#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using i64 = int_fast64_t;
constexpr i64 MAX = 510000;
constexpr i64 MOD = 1000000007;
template <i64 modulus>
class modcal
{

public:
    i64 a;

    constexpr modcal(const i64 x = 0) noexcept : a(x % modulus) {}
    constexpr i64 &value() noexcept { return a; }
    constexpr const i64 &value() const noexcept { return a; }
    constexpr modcal operator+(const modcal rhs) const noexcept
    {
        return modcal(*this) += rhs;
    }
    constexpr modcal operator-(const modcal rhs) const noexcept
    {
        return modcal(*this) -= rhs;
    }
    constexpr modcal operator*(const modcal rhs) const noexcept
    {
        return modcal(*this) *= rhs;
    }
    constexpr modcal operator/(const modcal rhs) noexcept
    {
        return modcal(*this) /= rhs;
    }
    constexpr modcal &operator+=(const modcal rhs) noexcept
    {
        a += rhs.a;
        if (a >= modulus)
        {
            a -= modulus;
        }
        return *this;
    }
    constexpr modcal &operator-=(const modcal rhs) noexcept
    {
        if (a < rhs.a)
        {
            a += modulus;
        }
        a -= rhs.a;
        return *this;
    }
    constexpr modcal &operator*=(const modcal rhs) noexcept
    {
        a = a * rhs.a % modulus;
        return *this;
    }
    constexpr modcal &operator/=(modcal rhs) noexcept
    {
        i64 exp = modulus - 2;
        while (exp)
        {
            if (exp % 2)
            {
                *this *= rhs;
            }
            rhs *= rhs;
            exp /= 2;
        }
        return *this;
    }
    i64 fac[MAX], finv[MAX], inv[MAX];
    void COMninit()
    {
        fac[0] = fac[1] = 1;
        finv[0] = finv[1] = 1;
        inv[1] = 1;
        for (int i = 2; i < MAX; i++)
        {
            fac[i] = fac[i - 1] * i % modulus;
            inv[i] = MOD - inv[modulus % i] * (modulus / i) % modulus;
            finv[i] = finv[i - 1] * inv[i] % modulus;
        }
    }
    i64 COMn(i64 n, i64 k)
    {
        if (n < k)
            return 0;
        if (n < 0 || k < 0)
            return 0;
        return fac[n] * (finv[k] * finv[n - k] % modulus) % modulus;
    }
    constexpr modcal<1000000007> modpow(const modcal<1000000007> &a, i64 n)
    {
        if (n == 0)
            return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if (n & 1)
            t = t * a;
        return t;
    }
};

vector<pair<i64, i64>> prime_factorize(i64 N)
{
    vector<pair<i64, i64>> res;
    for (i64 a = 2; a * a <= N; ++a)
    {
        if (N % a != 0)
            continue;
        i64 ex = 0;
        while (N % a == 0)
        {
            ++ex;
            N /= a;
        }

        res.push_back({a, ex});
    }

    if (N != 1)
        res.push_back({N, 1});
    return res;
}

using modc = modcal<1000000007>;
int main()
{
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    i64 n;
    cin >> n;
    vector<i64> a(n);
    vector<i64> f(1100000, 0);
    for (i64 i = 0; i < n; i++)
    {
        cin >> a[i];
        auto fs = prime_factorize(a[i]);
        for (auto v : fs)
            f[v.first] = max<i64>(f[v.first], v.second);
    }
    modcal<1000000007> LCM = 1;
    for (ll i = 2; i < 1100000; i++)
    {
        LCM *= LCM.modpow(modc(i), f[i]);
    }
    modcal<1000000007> ans = 0;
    for (auto A : a)
    {
        ans += LCM / A;
    }
    cout << ans.a << endl;
}


Measured memory_bytes: 13056