#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define pii pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define pll pair<ll,ll>
#define mat vector<vector<int>>
const int inf = 1 << 30;
const ll linf = 1e18;
const db EPS = 1e-7;
template<class T> void chmin(T& x, T y){if(x > y) x = y;}
template<class T> void chmax(T& x, T y){if(x < y) x = y;}

template<long long mod>
struct modint{
    long long num;

    constexpr modint(long long x = 0) : num((x + mod) % mod) {}

    constexpr modint &operator += (const modint& rhs){
        num = (num + rhs.num) % mod;
        return *this;
    }
    constexpr modint &operator -= (const modint& rhs){
        num  -= rhs.num;
        while(num < 0) num += mod;
        num %= mod;
        return *this;
    }
    constexpr modint &operator *= (const modint& rhs){
        num = num * rhs.num % mod;
        return *this;
    }
    constexpr modint &operator /= (modint rhs){
        int exp = mod - 2;
        while(exp > 0){
            if(exp % 2){
                *this *= rhs;
            }
            rhs *= rhs;
            exp /= 2;
        }
        return *this;
    }

    constexpr modint operator ++ (){
        ++num;
        return *this;
    }
    constexpr modint operator ++ (int n){
        modint tmp = *this;
        ++(*this);
        return tmp;
    }
    constexpr modint operator -- (){
        --num;
        return *this;
    }
    constexpr modint operator -- (int n){
        const modint tmp = *this;
        --(*this);
        return tmp;
    }

    void modpow(ll y){
        modint tmp = (*this);
        (*this) = 1;
        while(y > 0){
            if(y % 2){
                (*this) *= tmp;
            }
            tmp *= tmp;
            y /= 2;
        }
    }

    constexpr modint operator + (const modint& rhs) const {
        return modint(*this) += rhs;
    }
    constexpr modint operator - (const modint& rhs) const {
        return modint(*this) -= rhs;
    }
    constexpr modint operator * (const modint& rhs) const {
        return modint(*this) *= rhs;
    }
    constexpr modint operator / (const modint& rhs) const {
        return modint(*this) /= rhs;
    }

    
    friend ostream &operator << (ostream& lhs, const modint& rhs){
        return lhs << rhs.num;
    }

    friend istream &operator >> (istream& lhs, modint& rhs){
        long long tmp;
        lhs >> rhs.num;
        return lhs;
    }
};

#define mint modint<1000000007>

mint modpow(mint x, int y){
    if(y == 0) return 1;
    mint e = modpow(x, y / 2);
    e = e * e;
    return e * (y % 2 == 0 ? 1 : x);
}

int N;
int A[10010];
int cnt[1000010];


bool prm[200010];

void prime(int N){
    for(int i = 2; i <= N; i++) prm[i] = true;
    for(int i = 2; i <= N; i++){
        if(prm[i]){
            for(int j = i * 2; j <= N; j += i){
                prm[j] = false;
            }
        }
    }
}

vector<pii> prime_fac(int N){
    vector<pii> res;
    int cp = N;
    for(int i = 2; i * i <= cp; ++i){
        if(prm[i]){
            int cnt = 0;
            while(N % i == 0) N /= i, cnt++;
            if(cnt != 0) res.push_back({i, cnt});
        }
    }
    if(N != 1) res.push_back({N, 1});
    return res;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> N;
    prime(1010);
    for(int i = 0; i < N; ++i){
        cin >> A[i];
        auto v = prime_fac(A[i]);
        for(auto u : v) chmax(cnt[u.first], u.second);
    }
    mint lcm = 1;
    for(int i = 1; i <= 1e6; ++i){
        lcm *= modpow(i, cnt[i]);
    }
    
    mint res = 0;
    for(int i = 0; i < N; ++i){
        res += lcm / (mint)A[i];
    }
    cout << res << endl;
    return 0;
}

Measured memory_bytes: 3968