#include<bits/stdc++.h>
using namespace std;

typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int,int> pii;
typedef priority_queue< int, vector< int >, greater< int > >  minHeap;

#define ones(x) __builtin_popcount(x)
#define onesl(x) __builtin_popcountl(x)
#define onesll(x) __builtin_popcountll(x)

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define scn(n) scanf("%d",&n)
#define scnll(n) scanf("%lld",&n)
#define scn2(n,m) scanf("%d%d",&n,&m)
#define scn3(n,m,w) scanf("%d%d%d",&n,&m,&w)
#define scn2ll(n,m) scanf("%lld%lld",&n,&m)
#define atoz(v) v.begin(),v.end()
#define ratoz(v) v.rbegin(),v.rend()
#define Fill(a,v) memset(a,v,sizeof(a))
#define fi first
#define se second
#define inf 1e9
#define pi acos(-1.0)
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define mod 1000000007
#define FastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define bug(x) cerr << __LINE__ << " says: " << #x << " = " << (x) << "\n"

int Set(int N,int pos)
{
    return N=N | (1<<pos);
}
int reset(int N,int pos)
{
    return N = N & ~(1<<pos);
}
bool check(int N,int pos)
{
    return (bool)(N & (1<<pos));
}

inline int addmod(lli x,lli y)
{
    return (x%mod + y%mod)%mod;
}
inline int submod(lli x,lli y)
{
    return (x%mod - y%mod + mod)%mod;
}
inline int mulmod(lli x,lli y)
{
    return (x%mod * y%mod)%mod;
}


inline int nextSubMask(int i, int mask)
{
    return (i-1)&mask;   /// returns next  submask
}

template<typename T>
void we_r_done(T mssg)
{
    cout<<mssg;
    exit(0);
}

const int N = 1e6 + 7;
bool Composite[N];


long long pow(long long a, long long b, long long MOD)
{
 long long x=1,y=a;
 while(b > 0)
 	{
 		if(b%2 == 1)
 	{
 		x=(x*y);
 		if(x>MOD) x%=MOD;
 	}
 	y = (y*y);
 	if(y>MOD) y%=MOD;
 	b /= 2;
 	}
 return x;
}

int main()
{
    ///freopen("output.txt","w",stdout);
   // freopen("input.txt","r",stdin);
    FastIO;
    vector<int>primes;
    primes.pb(2);

    for(int i=3; (i*1LL*i) < N; i += 2){
        if(Composite[i]) continue;
        for(int j=i+i; j<N; j += i) Composite[j] = true;
    }
    for(int i=3; i<N; i += 2){
        if(Composite[i] == false) primes.pb(i);
    }

    int n;
    while(cin>>n){
        lli L = 1;
        lli a[n+1];
        map<int,int>pPow;
        for(int i=1; i<=n; i++){
            cin>>a[i];
            int ai = a[i];
            for(int p : primes){
                if((p*1LL*p)>ai) break;

                int cnt = 0;
                while(ai%p == 0){
                    ai /= p;
                    cnt++;
                }
                if(cnt) pPow[p] = max(pPow[p], cnt);
            }
            if(ai>1) pPow[ai] = max(1, pPow[ai]);
        }

        for(auto it : pPow){
            int c = it.se;
            while(c){
                c--;
                L = mulmod(L , it.fi);
            }
        }
      //  cout<<L<<" --- ";
        lli sum = 0;
        for(int i=1; i<=n; i++){
            sum = addmod(sum,mulmod(L, pow(a[i],mod-2,mod)));
        }
        cout<<sum<<endl;
    }

    return 0;
}

///sin and cos expect input in radians not degrees. so use , sin(degrees * pi / 180)
///using bs = bitset<MX>; // how many distinct number can be form?
///sort(atoz(v), [](const data x, const data y){return (x.a==y.a?x.b>y.b : x.a<y.a);});


Measured memory_bytes: 2040