#include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template<class F>auto recursive(F f){return[f](auto...a){return f(f,a...);};}
template<class I,class V=typename I::value_type>V sum_up(const I&l,const I&r){V v;for(I i=l;i!=r;i++)v=i==l?*i:v+*i;return v;}
template<class I,class T=iterator_traits<I>>I operator+(I it,int n){for(int i=0;i<n;i++)it++;return it;}
template<class I,class T=iterator_traits<I>>I operator-(I it,int n){for(int i=0;i<n;i++)it--;return it;}
template<class T>using rev_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>using vector2d=vector<vector<T>>;
struct fixprec{int x;fixprec(int d):x(d){}};
ostream&operator<<(ostream&o,fixprec f){return o<<fixed<<setprecision(f.x);}
void R_YESNO(bool p) { cout << (p ? "YES" : "NO") << endl; }
void R_YesNo(bool p) { cout << (p ? "Yes" : "No") << endl; }

/*!* [modint] *!*/
/*+* 剰余環整数と剰余階乗 *+*/
struct int_m;
int_m invmod(int_m);
int_m powmod(int_m, i64);
struct int_m {
    static i64 m;
    i64 v;
    int_m() {}
    int_m(i64 x) : v(x) {}
    int_m operator+(const int_m &y) const { return (v + y.v) % m; }
    int_m operator-(const int_m &y) const { return (v - y.v + m) % m; }
    int_m operator*(const int_m &y) const { return (v * y.v) % m; }
    int_m operator/(const int_m &y) const { return *this * invmod(y); }
    int_m operator^(const i64   &y) const { return powmod(*this, y); }
    void operator+=(const int_m &y) { *this = *this + y; }
    void operator-=(const int_m &y) { *this = *this - y; }
    void operator*=(const int_m &y) { *this = *this * y; }
    void operator/=(const int_m &y) { *this = *this / y; }
    void operator^=(const i64   &y) { *this = *this ^ y; }
    bool operator==(const int_m &y) const { return v == y.v; }
    bool operator!=(const int_m &y) const { return v != y.v; }
    friend istream &operator>>(istream &ist, int_m m) { ist >> m.v; return ist; }
    friend ostream &operator<<(ostream &ost, int_m m) { ost << m.v; return ost; }
};
i64 int_m::m;
// O(log a)
int_m powmod(int_m a, i64 p) {
    int_m v = 1;
    for(int_m b = a; p > 0; p >>= 1, b *= b ) if(p & 1) v *= b;
    return v;
}
int_m invmod(int_m x) {
    return powmod(x, x.m - 2);
}
struct ModFact {
    static vector<int_m> val, inv;
    static void Init(int N) { // O(N)
        val = vector<int_m>(++N, 1), inv = vector<int_m>(N, 1);
        for(int i = 1; i < N; i++) val[i] = val[i - 1] * i;
        inv[N - 1] = invmod(val[N - 1]);
        for(int i = N - 1; i > 0; i--) inv[i - 1] = inv[i] * i;
    }
};
vector<int_m> ModFact::val, ModFact::inv;
int_m Permutation(int n, int m) {
    if(n < m || m < 0 || n < 0) return 0;
    return ModFact::val[n] * ModFact::inv[n - m];
}
int_m Combination(int n, int m) {
    if(n < m || m < 0 || n < 0) return 0;
    return ModFact::val[n] * ModFact::inv[m] * ModFact::inv[n - m];
}
int_m Combination(vector<int> &n) {
    int s = accumulate(n.begin(), n.end(), 0);
    int_m r = ModFact::val[s];
    for(auto x : n) r *= ModFact::inv[x];
    return r;
}
int_m Multichoose(int n, int m) { return Combination(n + m - 1, m); }

/*!* [prime] *!*/
/*+* 素数生成、素因数分解 *+*/

// 素数列を作る
// N: 上限
struct PrimeSet {
    static vector<i64> p;
    static void Init(i64 N) {
        i64 c = 1;
        for (i64 c = 2; c <= N; c++) {
            bool flag = true;
            i64 d = (i64)sqrt(c);
            for (int i = 0; i < p.size(); i++) {
                if (c % p[i] == 0) {
                    flag = false;
                    break;
                }
                if (d < p[i]) break;
            }
            if (flag) p.push_back(c);
        }
    }
};
vector<i64> PrimeSet::p;
// 素因数分解を行う
// N: 対象, m: 因数分解形式のマップ
void Factorize(i64 N, map<i64, int> &m) {
    vector<i64> &p = PrimeSet::p;
    for (int i = 0; N != 1 && i < p.size(); i++) {
        while (N % p[i] == 0) {
            N /= p[i];
            m[p[i]]++;
        }
    }
    if (N > 1) m[N] = 1;
}

// O(N sqrt(M))
int main() {
    int_m::m = 1e9 + 7;
    const int M = 1e3 + 10;
    PrimeSet::Init(M);
    int N;
    cin >> N;
    int_m ans = 0;
    map<i64, int> l;
    vector<i64> A(N);
    for(i64 &a : A) {
        cin >> a;
        map<i64, int> m;
        Factorize(a, m);
        for(auto x : m) {
            l[x.first] = max(l[x.first], x.second);
        }
    }
    for(int i = 0; i < N; i++) ans += int_m(1) / A[i];
    for(auto x : l) ans *= int_m(x.first) ^ x.second;
    cout << ans << endl;
    return 0;
}



Measured memory_bytes: 896