/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author champon
 */

#include <iostream>
#include <fstream>

#include <bits/stdc++.h>
#define ok cout << "ok" << endl;
#define sp << " " <<
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const ll inf = 9e18;
template<typename T1, typename T2> ll ceill(T1 a, T2 b){ return (a+b-1)/b; }
void ans(bool b, ostream& out=cout){ out << (b ? "Yes" : "No") << endl; }
void ans2(bool b, ostream& out=cout){ out << (b ? "YES" : "NO") << endl; }
template<typename T> inline bool chmax(T &a, T b){ if(a<b){a=b; return true;} return false; }
template<typename T> inline bool chmin(T &a, T b){ if(b<a){a=b; return true;} return false; }
template<typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val){fill((T*)array, (T*)(array+N), val);}
int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};

#ifndef INCLUDE_DEBUG_HPP
#define INCLUDE_DEBUG_HPP

#include <vector>
#include <map>
using namespace std;

class debug
{
public:
    typedef long long ll;
    template<typename T> void vd(vector<T> vec);
    template<typename T> void vd2(vector<vector<T>> vec);
    template<typename T> void vpd(vector<pair<int, int>> vec);
    template<typename T> void ad(T *arr, ll n);
    template<typename T, size_t N> void ad2(T (&arr)[N], ll n);
    template<typename T> void md(T mp);
};

#endif //INCLUDE_DEBUG_HPP

template<typename T> void debug::vd(vector<T> vec)
{
    for(auto vv : vec) cout << vv << " ";
    cout << endl;
}

template<typename T> void debug::vd2(vector<vector<T>> vec)
{
    for(auto vv : vec) for(auto vvv : vv) cout << vvv << " ";
    cout << endl;
}

template<typename T> void debug::vpd(vector<pair<int, int>> vec) {
    for(auto const& vv : vec) {
        cout << vv.first << " " << vv.second << endl;
    }
    cout << endl;
}

template<typename T> void debug::ad(T *arr, ll n)
{
    for(int i=0; i<=n; i++) cout << arr[i] << " ";
    cout << endl;
}

template<typename T, size_t N> void debug::ad2(T (&arr)[N], ll n)
{
    for(int i=0; i<=N; i++) for(int j=0; j<=n; j++) cout << arr[i][j] << " ";
    cout << endl;
}

template<typename T> void debug::md(T mp)
{
    cout << "key : value" << endl;
    for(auto const& m : mp) cout << m.first << " : " << m.second << endl;
    cout << endl;
}
debug debug;

#ifndef INCLUDE_MINT_HPP
#define INCLUDE_MINT_HPP

class mint
{
public:
    const int mod = 1e9+7;
    typedef long long ll;
    ll a;
    mint(ll a=0):a((a%mod + mod)%mod){}
    mint operator-() const { return mint(-a); }
    mint operator+(const mint rhs) const {
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint rhs) const {
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint rhs) const {
        mint res(*this);
        return res*=a;
    }
    mint& operator+=(const mint rhs) {
        if((a += rhs.a) >= mod) a -= mod;
        return *this;
    }
    mint& operator-=(const mint rhs) {
        if((a += mod-rhs.a) >= mod) a -= mod;
        return *this;
    }
    mint& operator*=(const mint rhs) {
        (a *= rhs.a) %= mod;
        return *this;
    }
    mint pow(ll t) const {
        if(!t) return 1;
        mint b = pow(t>>1);
        b *= b;
        if(t&1) b *= *this;
        return b;
    }

    mint inv() const {
        return pow(mod-2);
    }
    mint& operator/=(const mint rhs) {
        return (*this) *= rhs.inv();
    }
    mint operator/(const mint rhs) const {
        mint res(*this);
        return res/=rhs;
    }
};

#endif //INCLUDE_MINT_HPP

#ifndef INCLUDE_FACTOR_HPP
#define INCLUDE_FACTOR_HPP



using namespace std;

class prime {
public:
    typedef long long ll;
    template<typename T> map<ll, ll> factor(T val);
    template<typename T> bool isPrime(T val);
};

#endif //INCLUDE_FACTOR_HPP

template<typename T> map<ll, ll> prime::factor(T val)
{
    vector<int> f;
    for(ll i=2; i*i<=val; i++){
        while(val%i == 0) {
            f.push_back(i);
            val /= i;
            if(val == 0) break;
        }
    }
    if(val > 1) f.push_back(val);
    map<ll, ll> res;
    for(auto const& e : f){
        res[e]++;
    }
    return res;
}

template<typename T> bool prime::isPrime(T val)
{
    for(ll i=2; i*i<=val; i++){
        if(val%i == 0) return false;
    }
    return true;
}

class EFlatten {
public:
	void solve(std::istream& in, std::ostream& out)
	{
        int n;
        in >> n;
        vector<mint> a(n);
        int ina;
        for(int i=0; i<n; i++){
            in >> ina;
            a[i].a = ina;
        }

        prime prime;
        map<ll, ll> fact;
        for(int i=0; i<n; i++){
            map<ll, ll> f = prime.factor(a[i].a);

            for(auto const& e : f){
                fact[e.first] = max(fact[e.first], e.second);
            }
        }

        //debug.md(fact);

        mint lcm(1);
        for(auto const& e : fact){
            for(int i=0; i<e.second; i++){\
                mint buf(e.first);
                lcm *= buf;
            }
        }

        mint res(0);
        for(int i=0; i<n; i++){
            res += lcm/a[i];
        }

        out << res.a << endl;
	}
};


int main() {
	EFlatten solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
	return 0;
}


Measured memory_bytes: 1024