#pragma GCC target("avx")
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DB double
#define ST string
#define BS bitset
#define PA pair<LL,LL>
#define VE vector
#define VL vector<LL>
#define VP vector<pair<LL,LL>>
#define VVL vector<vector<LL>>
#define PQ priority_queue
#define PQS priority_queue<LL,vector<LL>,greater<LL>>
#define PB push_back
#define POB pop_back
#define PF push_front
#define POF pop_front
#define EB emplace_back
#define TS to_string
#define TU to_ullong
#define BPL __builtin_popcountll
#define FOR(i,a,n) for(i=a;i<n;i++)
#define FORR(i,a,n) for(i=n-1;i>=a;i--)
#define rep(i,n) FOR(i,0,n)
#define repr(i,n) FORR(i,0,n)
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define SORT(a) sort(ALL(a))
#define REV(a) reverse(ALL(a))
#define UB(a,n) *upper_bound(ALL(a),n)
#define LB(a,n) *lower_bound(ALL(a),n)
#define INF 1145141919810364364
#define PI 3.14159265358979
#define MOD 1000000007
//#define MOD 998244353
#define ERR 0.00000001
#define NUM 200010
#define FAST cin.tie(0);ios::sync_with_stdio(false)

void Yn(LL a){if(a)printf("Yes\n");else printf("No\n");}
void YN(LL a){if(a)printf("YES\n");else printf("NO\n");}
LL pwmn(LL a,LL n){LL ans=1;while(ans<a)ans*=n;return ans;}
LL dig(LL n){LL ret=0;while(n)n/=10,ret++;return ret;}
LL LBn(VL &v,LL a){LL mx=v.size(),mn=-1,md;while(mx-mn>1){md=(mx+mn)/2;if(v[md]<a)mn=md;else mx=md;}return mx;}
LL GCD(LL a,LL b){LL c=1,tmp=max(a,b);b=min(a,b);a=tmp;while(c!=0){c=a%b;a=b;b=c;}return a;}
LL LCM(LL a,LL b){return a*b/GCD(a,b);}
int lcmp(const void* a,const void* b){if(*(LL*)a>*(LL*)b)return 1;if(*(LL*)a<*(LL*)b)return -1;return 0;}
int lcmpr(const void* a,const void* b){if(*(LL*)a>*(LL*)b)return -1;if(*(LL*)a<*(LL*)b)return 1;return 0;}
int ccmp(const void* a,const void* b){return *(char*)a-*(char*)b;}
int ccmpr(const void* a,const void* b){return *(char*)b-*(char*)a;}
int scmp(const void* a,const void* b){return strcmp((char*)a,(char*)b);}
int scmpr(const void* a,const void* b){return strcmp((char*)b,(char*)a);}
LL cmod(LL a,LL m){if(a%m<0)return a%m+abs(m);else return a%m;}
LL DIV(LL a,LL d,LL m){LL l=m,x=1,y=0,k;while(l){k=d/l;d-=k*l;swap(l,d);x-=k*y;swap(x,y);}return cmod(a*cmod(x,m),m);}
LL POW(LL a,LL n,LL m){LL ans=1;while(n>0){if(n&1)ans=ans*a%m;a=a*a%m;n>>=1;}return ans;}
LL fact[NUM],finv[NUM],inv[NUM];
void comi(){LL i;fact[0]=fact[1]=1;finv[0]=finv[1]=1;inv[1]=1;FOR(i,2,NUM){fact[i]=fact[i-1]*i%MOD;inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;finv[i]=finv[i-1]*inv[i]%MOD;}}
LL com(LL n,LL k){if(n<k||n<0||k<0)return 0;return fact[n]*(finv[k]*finv[n-k]%MOD)%MOD;}
bool cmps(pair<LL,LL> a,pair<LL,LL> b){if(a.second!=b.second)return a.second<b.second;return a.first<b.first;}
template<typename T>bool chmax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T &a,T b){if(a>b){a=b;return true;}return false;}

bool ifpr(LL p){LL i,j,n[8]={7,11,13,17,19,23,29,31},r=(LL)sqrt(p),flag=0;if(p%2==0||p%3==0||p%5==0)flag=1;FOR(i,0,8){if(p<=1)flag=1;if(p==2||p==3||p==5){flag=0;break;}if(flag==1)break;for(j=n[i];j<=r;j+=30)if(p%j==0){flag=1;break;}}if(flag==0)return true;return false;}
VL pri;
void prii(LL n){LL i,j,k,p,f,s,a[8]={7,11,13,17,19,23,29,31};pri.PB(2);pri.PB(3);pri.PB(5);for(i=0;i<=n;i+=30)rep(j,8)if(i+a[j]<=n){p=i+a[j],f=0,s=sqrt(p)+1;FOR(k,3,pri.size()){if(pri[k]>s)break;if(p%pri[k]==0)f=1;}if(f==0)pri.PB(p);}}
LL LCMM(VL v,LL m){LL n=v.size(),i,j,k=0,r,mx,lcm=1;VL p;rep(i,n)chmax(k,v[i]);r=sqrt(k);prii(r);FOR(i,2,r+1)if(ifpr(i))p.PB(i);rep(i,p.size()){mx=0;rep(j,n){k=0;while(v[j]%p[i]==0)v[j]/=p[i],k++;chmax(mx,k);}(lcm*=POW(p[i],mx,m))%=m;}SORT(v);rep(i,n)if(i==n-1||v[i]!=v[i+1])(lcm*=v[i])%=m;return lcm;}

int main(){
	FAST;
	LL N,i,lcm,ans=0;
  cin>>N;
  VL A(N);
  rep(i,N)cin>>A[i];
  lcm=LCMM(A,MOD);
  rep(i,N)ans=(ans+DIV(lcm,A[i],MOD))%MOD;

  cout<<ans<<endl;
}


Measured memory_bytes: 384