#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <array>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <sstream>
#include <stdio.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <list>
#include <numeric>
#include <stack>
#include <iomanip>
#include <random>
#include <complex>
#include <functional>

//using namespace std;

#define Rep(i,a,b) for(int i = a; i < b; ++i)
#define rep(i,b) Rep(i,0,b)
#define allof(a) (a).begin(), (a).end()

using ll =  long long;

constexpr int inf = 1e9 + 7;
constexpr ll infll = 1ll << 60ll;
constexpr ll mod = 1e9 + 7;
// 0~3までは右左下上 4~7までは斜め
constexpr int dx[] = { 1, 0, -1, 0, 1, 1, -1, -1 };
constexpr int dy[] = { 0, -1, 0, 1, 1, -1, -1, 1 };

template<typename T> void chmax(T& a, T b) { a = std::max(a, b); }
template<typename T> void chmin(T& a, T b) { a = std::min(a, b); }
template<typename T> void chadd(T& a, T b) { a = a + b; }

using pint = std::pair<int, int>;
using pll = std::pair<ll, ll>;

namespace {  // 名前なし名前空間
	// gcd, lcm は C++17 でstdに標準入りしたので言語のバージョンに注意
	// 最大公約数
	ll gcd(ll a, ll b) {
		if (b == 0) return a;
		return gcd(b, a % b);
	}

	// 最小公倍数
	ll lcm(ll a, ll b) {
		return a / gcd(a, b) * b;
	}

	// 素因数分解 O(√N)
	template <typename T>
	std::vector<T> factorize(T x) {
		if (x <= 1) return std::vector<T>();
		std::vector<T> r; T x0 = x;
		while (x % 2 == 0)
			x /= 2, r.push_back(2);
		for (long long f = 3; f * f <= x0; f += 2)
			while (x % f == 0)
				x /= f, r.push_back(f);
		if (x > 1) r.push_back(x);
		return r;
	}
	template<typename T>
	std::map<T, T> factorize(T x) {
		if (x <= 1) return std::map<T, T>();
		std::map<T, T> mp;
		for (T i = 2; i * i <= x; ++i) {
			while (x % i == 0) {
				x /= i;
				mp[i]++;
			}
		}
		if (x != 1) {
			mp[x]++;
		}
		return mp;
	}

	ll powll(ll a, ll n) {
		ll result = 1;
		ll base = a;
		ll mask = 1;
		while (mask <= n) {
			if (n & mask) (result *= base) %= mod;
			mask <<= 1;
			(base *= base) %= mod;
		}
		return result;
	}

	template<int MOD> struct Fp {
		long long val;
		constexpr Fp(long long v = 0) noexcept : val(v% MOD) {
			if (val < 0) val += MOD;
		}
		constexpr int getmod() { return MOD; }
		constexpr Fp operator - () const noexcept {
			return val ? MOD - val : 0;
		}
		constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
		constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
		constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
		constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
		constexpr Fp& operator += (const Fp& r) noexcept {
			val += r.val;
			if (val >= MOD) val -= MOD;
			return *this;
		}
		constexpr Fp& operator -= (const Fp& r) noexcept {
			val -= r.val;
			if (val < 0) val += MOD;
			return *this;
		}
		constexpr Fp& operator *= (const Fp& r) noexcept {
			val = val * r.val % MOD;
			return *this;
		}
		constexpr Fp& operator /= (const Fp& r) noexcept {
			long long a = r.val, b = MOD, u = 1, v = 0;
			while (b) {
				long long t = a / b;
				a -= t * b; std::swap(a, b);
				u -= t * v; std::swap(u, v);
			}
			val = val * u % MOD;
			if (val < 0) val += MOD;
			return *this;
		}
		constexpr bool operator == (const Fp& r) const noexcept {
			return this->val == r.val;
		}
		constexpr bool operator != (const Fp& r) const noexcept {
			return this->val != r.val;
		}
		friend constexpr std::ostream& operator << (std::ostream& os, const Fp<MOD>& x) noexcept {
			return os << x.val;
		}
		friend constexpr Fp<MOD> modpow(const Fp<MOD>& a, long long n) noexcept {
			if (n == 0) return 1;
			auto t = modpow(a, n / 2);
			t = t * t;
			if (n & 1) t = t * a;
			return t;
		}
	};
	using mint = Fp<mod>;
}


int main() {

	ll n;
	std::cin >> n;
	std::vector<ll> a(n);
	rep(i, n) std::cin >> a[i];

	// xを構成する要素
	std::map<ll, ll> mp;
	std::vector<std::map<ll, ll>> fact(n, std::map<ll, ll>());
	rep(i, n) {
		ll tmp = a[i];
		for (ll j = 2; j * j <= tmp; ++j) {
			while (tmp % j == 0) {
				tmp /= j;
				fact[i][j]++;
			}
		}
		if (tmp != 1) {
			int num = tmp;
			fact[i][num]++;
		}
		// 素因数を取得できた
		for (auto v : fact[i]) {
			mp[v.first] = std::max(mp[v.first], v.second);
		}
	}

	mint ans = 0;

	mint lcm = 1;
	for (auto v : mp) {
		mint tmp = powll(v.first, v.second);
		lcm *= tmp;
	}

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

	std::cout << ans << std::endl;

	return 0;
}

Measured memory_bytes: 3968