#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cassert>
#include <array>
#include <memory>
#include <random>
#ifdef DEBUG
#include "./Lib/debug.hpp"
#include "./Lib/Timer.hpp"
#include "./Lib/sample.hpp"
#else
#define dump(...)
#endif

/* (=＾o＾=) */
#define int ll

/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)(e-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
template<class T>
inline auto sort(T& t) { std::sort(ALL(t)); }
template<class T>
inline auto rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }
template<class T>
inline auto unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); }
template<class T, class S>
inline auto chmax(T& t, const S& s) { if (s > t) { t = s; return true; } return false; }
template<class T, class S>
inline auto chmaxE(T& t, const S& s) { if (s >= t) { t = s; return true; } return false; }
template<class T, class S>
inline auto chmin(T& t, const S& s) { if (s < t) { t = s; return true; } return false; }
inline auto BR() { std::cout << "\n"; }

/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;
template<class T>
using V = std::vector<T>;

/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;
using std::tuple;

/* constant value */
constexpr ll MOD = 1000000007;
//constexpr ll MOD = 998244353;

/* Initial processing  */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;

/* Remove the source of the bug */
inline signed pow(signed, signed) { assert(false); return -1; }

/* define hash */
namespace std {
template <>	class hash<std::pair<ll, ll>> { public:	size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } };
}

/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for (T& x : vec) is >> x; return is; }

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


ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }

/**
*  素因数分解をし，全ての素因数を返す
*/
std::unordered_map<ll, ll> prime_decomposition(ll n) {
	ll i = 2;
	std::unordered_map<ll, ll> table{};
	while (i * i <= n) {
		while (n % i == 0) {
			n /= i;
			table[i]++;
		}++i;
	}
	if (n > 1) {
		table[n]++;
		return table;
	}
	return table;
}


ll pow(ll a, ll b) {
	ll ans = 1;
	while (b > 0) {
		if (b % 2 == 1) {
			ans *= a;
			ans %= MOD;
		}
		b /= 2;
		a *= a;
		a %= MOD;
	}
	return ans;
}


auto solve(ll n, const VL& v) {

	ll g = 1;
	{
		unordered_map<ll, ll> mp;
		REPC(x, v) {
			auto lst = prime_decomposition(x);
			REPC(p, lst) {
				ll k = p.first;
				ll val = p.second;

				if (mp.find(k) == mp.end()) {
					mp.emplace(k, 0);
				} else {
					auto& mm = mp[k];
					REP(i, std::min(mm, val)) {
						g *= k;
						g %= MOD;
					}
				}
				chmax(mp[k], val);
			}
			//dump(lst);
		}
	}
	ll p = 1;
	REPC(x, v) { p *= x; p %= MOD; }

	ll t = (p * pow(g, MOD - 2)) % MOD;

	//dump(p, g, t);

	ll ans = 0;
	REPC(x, v) {
		ll rev = pow(x, MOD - 2);
		ll val = (t * rev) % MOD;
		ans += val;
		ans %= MOD;
	}
	return ans;
}


auto solve_c(ll n, const VL& v) {

	ll t = 1;
	REPC(x, v) { t = lcm(t, x); }

	//dump(p, g, t);

	ll ans = 0;
	REPC(x, v) {
		ll rev = pow(x, MOD - 2);
		ll val = (t * rev) % MOD;
		ans += val;
		ans %= MOD;
	}
	return ans;
}


signed main() {
	/**/
	ll n;
	cin >> n;
	VL v(n);
	cin >> v;

	auto ans = solve(n, v);
	cout << ans << endl;
	/*/
	auto gen = Sample::SampleGenerator();
	REP(_, 100) {
		auto [n] = gen.generate(PAIR{3,5});
		auto [v] = gen.generate(V<PAIR>(n, PAIR{2,10}));

		auto ans = solve(n, v);
		auto ans_c = solve_c(n, v);
		if (ans != ans_c) {
			cout << n << endl;
			REPC(x, v) { cout << x << " "; }BR();
			dump(ans, ans_c);
			return 0;
		}
	}

	/**/
}

Measured memory_bytes: 768