#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;

constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();

//==================================

template <std::int_fast64_t Modulus>
class ModInt {
    using i64 = std::int_fast64_t;

    // friend
    template <std::int_fast64_t _MOD>
    friend std::istream& operator>>(std::istream& is, ModInt<_MOD>& rhs);
    template <std::int_fast64_t _MOD>
    friend std::ostream& operator<<(std::ostream& os, const ModInt<_MOD>& rhs);

private:
    i64 a;

public:
    /**
     * コンストラクタ
     */
    constexpr ModInt(const i64 x = 0) noexcept : a(x % Modulus) {
        if (a < 0) a += Modulus;
    }

    constexpr i64& value() noexcept { return a; }
    constexpr const i64& value() const noexcept { return a; }

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

    constexpr ModInt& operator+=(const ModInt rhs) noexcept {
        a += rhs.a;
        if (a >= Modulus) {
            a -= Modulus;
        }
        return *this;
    }
    constexpr ModInt& operator-=(const ModInt rhs) noexcept {
        if (a < rhs.a) {
            a += Modulus;
        }
        a -= rhs.a;
        return *this;
    }
    constexpr ModInt& operator*=(const ModInt rhs) noexcept {
        a = a * rhs.a % Modulus;
        return *this;
    }
    constexpr ModInt& operator/=(ModInt rhs) noexcept {
        i64 exp = Modulus - 2;
        while (exp) {
            if (exp & 1) {
                *this *= rhs;
            }
            rhs *= rhs;
            exp >>= 1;
        }
        return *this;
    }

    constexpr ModInt& operator++() noexcept {
        *this += 1;
        return *this;
    }
    constexpr ModInt operator++(int) noexcept {
        ModInt res = *this;
        *this += 1;
        return res;
    }
    constexpr ModInt& operator--() noexcept {
        *this -= 1;
        return *this;
    }
    constexpr ModInt operator--(int) noexcept {
        ModInt res = *this;
        *this -= 1;
        return res;
    }

    constexpr bool operator<(const ModInt& rhs) const noexcept {
        return a < rhs.a;
    }
    constexpr bool operator>(const ModInt& rhs) const noexcept {
        return a > rhs.a;
    }
    constexpr bool operator<=(const ModInt& rhs) const noexcept {
        return a <= rhs.a;
    }
    constexpr bool operator>=(const ModInt& rhs) const noexcept {
        return a >= rhs.a;
    }
    constexpr bool operator==(const ModInt& rhs) const noexcept {
        return a == rhs.a;
    }

    constexpr ModInt pow(i64 k) const noexcept {
        ModInt res = 1;
        ModInt tmp = *this;
        for (; k > 0; k >>= 1) {
            if (k & 1) res *= tmp;
            tmp *= tmp;
        }
        return res;
    }

    constexpr ModInt inverse() const noexcept {
        i64 q = a;
        i64 b = Modulus, u = 1, v = 0;
        while (b) {
            i64 t = q / b;
            q -= t * b;
            swap(q, b);
            u -= t * v;
            swap(u, v);
        }
        u %= Modulus;
        if (u < 0) u += Modulus;
        return u;
    }
};

// iostream用の関数[ModInt]
template <std::int_fast64_t Modulus>
std::istream& operator>>(std::istream& is, ModInt<Modulus>& rhs) {
    is >> rhs.a;
    return is;
}
template <std::int_fast64_t Modulus>
std::ostream& operator<<(std::ostream& os, const ModInt<Modulus>& rhs) {
    os << rhs.a;
    return os;
}

constexpr ll MOD = (ll)1e9 + 7;

vector<Pll> factorize(ll a) {
    vector<Pll> res;
    for (ll i = 2; i * i <= a; i++) {
        ll cnt = 0;
        while (a % i == 0) {
            a /= i;
            ++cnt;
        }
        res.emplace_back(i, cnt);
    }
    if (a != 1) {
        res.emplace_back(a, 1);
    }
    return move(res);
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N;
    cin >> N;
    vector<ModInt<MOD>> A(N);
    for (int i = 0; i < N; i++) {
        cin >> A[i];
    }

    map<ll, ll> mp;

    for (int i = 0; i < N; i++) {
        auto factors = factorize(A[i].value());
        for (const auto& p : factors) {
            mp[p.first] = max(mp[p.first], p.second);
        }
    }

    ModInt<MOD> lc = 1;
    for (const auto& p : mp) {
        lc *= ModInt<MOD>(p.first).pow(p.second);
    }

    vector<ModInt<MOD>> B(N);
    for (int i = 0; i < N; i++) {
        B[i] = lc / A[i];
    }

    ModInt<MOD> ans = 0;
    for (int i = 0; i < N; i++) {
        ans += B[i];
    }

    cout << ans << endl;

    return 0;
}


Measured memory_bytes: 1152