#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define outmat(v) for(auto i : v){for(auto j : i) cout << j << " ";cout << endl;}
#define in(n,v) for(int i=0; i<(n); i++){cin >> v[i];}
#define out(n) cout << (n) << endl
#define fi first
#define se second
#define pb push_back
#define mod 1000000007
#define infi 1900000000
#define infl 1100000000000000000
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
#define csp << " " <<
#define outset(n) cout << fixed << setprecision(n);
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template<typename T> using ve = vector<T>;
template<typename T> using pq2 = priority_queue<T>;
template<typename T> using pq1 = priority_queue<T,vector<T>,greater<T>>;

template <typename T> bool chmax(T &a, T b) {if(a < b) {a = b;return 1;}return 0;}
template <typename T> bool chmin(T &a, T b) {if(a > b) {a = b;return 1;}return 0;}


template <typename T> T gcd(T a, T b) {if(b == 0) return a;return gcd(b,a%b);}
template <typename T> T lcm(T a, T b) {return a*b/gcd(a,b);}
template <typename T> T extgcd(T a, T b, T& x, T& y){
    T d = a;
    if(b != 0){d = extgcd(b,a%b,y,x); y-=(a/b)*x;}
    else x=1,y=0;
    return d;
}
template <typename T> T modpow(T x, T n, T m) {
    if(n==0) return 1;
    T resp = modpow(x*x%m,n/2,m);
    if(n&1) resp = resp*x%m;
    return resp;
}
template <typename T> T modinverse(T a, T m) {
    T x,y;
    extgcd(a,m,x,y);
    return (m+x%m)%m;
}
struct combination {
    ll M = mod;
    vector<ll> fact;vector<ll> ifact;
    combination(ll n):fact(n+1),ifact(n+1){
        fact[0]=1;ifact[0]=1;
        for (ll i = 0; i<n; i++) {fact[i+1] = fact[i]*(i+1) % M;ifact[i+1] = ifact[i]*modpow(i+1, M-2, M) % M;}
    }
    ll com(ll a, ll b){
        if(a == 0 && b == 0)return 1;if(a < b || a < 0)return 0;
        ll tmp = ifact[a-b]* ifact[b] % M;
        return tmp * fact[a] % M;
    }
};



vector<int> prime;
int max_a = 1000001;

vector<int> show_all_prime(int a,vector<int> b = {}){
    if(prime[a] == a){
        b.pb(a);
        return b;
    }else{
        b.pb(prime[a]);
        return show_all_prime(a/prime[a],b);
    }
}



int main()
{

    int N;
    cin >> N;
    vi A(N);
    in(N,A);
    prime.assign(max_a,-1);
    prime[1] = 1;
    reps(i,2,max_a){
        if(prime[i] == -1){
            prime[i] = i;
            for (int j = i+i; j <= max_a; j+=i) {
                prime[j] = i;
            }
        }
    }
    
    ve<map<int,ll>> A_prime(N);
    map<int,ll> A_lcm;
    
    rep(i,N){
        vi aa = show_all_prime(A[i]);
        for(int a : aa){
            if(A_prime[i].count(a)) A_prime[i][a]*=(ll)a;
            else A_prime[i][a] = (ll)a;
        }
        for(auto b : A_prime[i]){
            int a = b.fi;
            if(A_lcm.count(a)) chmax(A_lcm[a],A_prime[i][a]);
            else A_lcm[a] = A_prime[i][a];
        }
        
    }
    
    ll ans = 0;
    ll an = 1;
    
    for(auto a : A_lcm){
        an *= (ll)a.se%mod;
        an %= mod;
    }
    rep(i,N){
        ans += an*modinverse(A[i],mod)%mod;;
        ans %= mod;
    }
    out(ans);
    
    

    return 0;
}


Measured memory_bytes: 7808