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

#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define INF 10000000000

using ll = long long;
using Graph = vector<vector<int>>;
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl

// modint: mod 計算を int を扱うように扱える構造体
template<int MOD> struct Fp {
    long long val;
    constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
        if (val < 0) val += MOD;
    }
    constexpr int getmod() { return MOD; }
    constexpr Fp operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp& operator += (const Fp& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Fp& operator -= (const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Fp& operator *= (const Fp& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp& operator /= (const Fp& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator == (const Fp& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const Fp& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if (n & 1) t = t * a;
        return t;
    }
};
using mint = Fp<1000000007>;

int main(){
    int N; cin>>N;
    vector<ll> A(N);
    int MAX_A = 1000010;
    vector<ll> divisor(MAX_A+1,-1);
    for(int i = 2; i <= sqrt(MAX_A); i++){
        if(divisor.at(i)!=-1)continue;
        for(int j = 2; j*i <= MAX_A; j++){
            divisor.at(i*j) = i;
        }
    }
    map<ll,ll> F;
    rep(i,N){
        cin>>A.at(i);
        ll a = A.at(i);
        map<ll,ll> tmp;
        while(divisor.at(a)!=-1){
            tmp[divisor.at(a)]++;
            a /= divisor.at(a);
        }
        if(a!=1)tmp[a]++;
        for(auto p:tmp){
            // cout<<p.first<<" "<<p.second<<endl;
            ll d = p.first;
            ll c = p.second;
            F[d] = max(c,F[d]);
        }
    }
    /*LCM求める。*/
    mint LCM = 1;
    for(auto p: F){
        ll d = p.first;
        ll c = p.second;
        LCM *= modpow(mint(d),c);
    }
    mint res = 0;
    rep(i,N){
        res += LCM/A.at(i);
    }
    cout<<res<<endl;
}



Measured memory_bytes: 8704