#include <bits/stdc++.h>

using namespace std;

#define DUMP(x) std::cerr << (#x) << " = " << (x) << "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, k, n) for (int i = (k); i < (int)(n); ++i)
#define ALL(r) r.begin(), r.end()
#define YES puts("YES")
#define Yes puts("Yes")
#define NO puts("NO")
#define No puts("No")
#define IMP puts("IMPOSSIBLE")
#define Imp puts("Impossible")
#define imp puts("impossible")
#define M1 puts("-1")
#define pb push_back
#define eb emplace_back
#define fi first
#define se second

template <typename T>
ostream &operator<<(ostream &os, vector<T> &v)
{
    os << "{";
    rep(i, v.size()) os << v[i] << (i == (int)v.size() - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T>
T dup(T x, T y)
{
    return (x + y - 1) / y;
};
template <typename A, size_t N, typename T>
inline void arrayFill(A (&array)[N], const T &val) { std::fill((T *)array, (T *)(array + N), val); }
struct in
{
    const size_t n = 0;
    in() = default;
    in(size_t n) : n(n){};
    template <typename T>
    operator T()
    {
        T ret;
        cin >> ret;
        return ret;
    }
    template <typename T>
    operator vector<T>()
    {
        assert(n != 0);
        vector<T> ret(n);
        for (auto &x : ret)
            cin >> x;
        return ret;
    }
};

using ll = int64_t;
using vint = vector<int32_t>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pint = pair<int32_t, int32_t>;
using vpint = vector<pint>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using setint = set<int32_t>;
using setstr = set<string>;
using qint = queue<int32_t>;
using qpint = queue<pint>;

constexpr std::int32_t INF = 1001001001;
constexpr std::int64_t LINF = 1001001001001001001;

//                  9876543210
constexpr int mod = 1000000007;
class mint
{
private:
    std::int64_t m_x;

public:
    mint(std::int64_t m_x = 0) : m_x((m_x % mod + mod) % mod) {}
    std::int64_t get() const { return m_x; }
    mint operator-() const { return mint(-m_x); }
    mint &operator+=(const mint a)
    {
        if ((m_x += a.m_x) >= mod)
            m_x -= mod;
        return *this;
    }
    mint &operator-=(const mint a)
    {
        if ((m_x += mod - a.m_x) >= mod)
            m_x -= mod;
        return *this;
    }
    mint &operator*=(const mint a)
    {
        (m_x *= a.m_x) %= mod;
        return *this;
    }
    mint operator+(const mint a) const
    {
        mint res(*this);
        return res += a;
    }
    mint operator-(const mint a) const
    {
        mint res(*this);
        return res -= a;
    }
    mint operator*(const mint a) const
    {
        mint res(*this);
        return res *= a;
    }

    mint pow(const std::int64_t t) const
    {
        if (!t)
            return 1;
        mint a = pow(t >> 1);
        a *= a;
        if (t & 1)
            a *= *this;
        return a;
    }
    // for prime mod
    mint inv() const
    {
        return pow(mod - 2);
    }
    mint &operator/=(const mint a)
    {
        return (*this) *= a.inv();
    }
    mint operator/(const mint a) const
    {
        mint res(*this);
        return res /= a;
    }
};
ostream &operator<<(ostream &os, const mint a)
{
    os << a.get();
    return os;
}

template <typename T>
vector<pair<T, ll>> rle(vector<T> v)
{
    vector<pair<T, ll>> ret;
    ret.reserve(v.size() / 2);
    for (const auto x : v)
    {
        if (ret.empty() || ret.back().first != x)
        {
            ret.emplace_back(x, 1);
        }
        else
        {
            ++ret.back().second;
        }
    }
    return ret;
}
vector<pair<char, ll>> rle(string s)
{
    vector<pair<char, ll>> ret;
    ret.reserve(s.size() / 2);
    for (const auto c : s)
    {
        if (ret.empty() || ret.back().first != c)
        {
            ret.emplace_back(c, 1);
        }
        else
        {
            ++ret.back().second;
        }
    }
    return ret;
}

struct primeSieve
{
    ll n;
    vll prime_factor;
    vll primes;

    primeSieve(ll n = 1)
        : n(n), prime_factor(n + 1, 0)
    {
        prime_factor[0] = prime_factor[1] = -1;
        for (ll i = 2; i <= n; ++i)
        {
            if (prime_factor[i])
                continue;
            primes.pb(i);
            prime_factor[i] = i;
            for (ll j = i * i; j <= n; j += i)
            {
                if (!prime_factor[j])
                    prime_factor[j] = i;
            }
        }
    }
    bool isPrime(ll x) { return prime_factor[x] == x; }
    vll factorList(ll x)
    {
        vll res;
        while (x != 1)
        {
            res.pb(prime_factor[x]);
            x /= prime_factor[x];
        }
        return res;
    }
    vpll factor(ll x)
    {
        return rle(factorList(x));
    }
};

void Main()
{
    int n = in();
    vll a = in(n);
    mint ans = 0;

    primeSieve ps(1000005);
    map<ll, ll> mp;

    rep(i, n)
    {
        auto c = ps.factor(a[i]);
        for (const auto e : c)
        {
            mp[e.fi] = max(mp[e.fi], e.se);
        }
    }
    mint lcm = 1;
    for (auto e : mp)
    {
        rep(i, e.se)
        {
            lcm *= e.fi;
        }
    }

    rep(i, n)
    {
        ans += lcm / a[i];
    }
    cout << ans << endl;
}

signed main()
{
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << std::fixed << std::setprecision(15);
    Main();
    return 0;
}


Measured memory_bytes: 9460