#include <bits/stdc++.h>

using namespace std;

const long long MOD = 1e9 + 7;

int str[1000001]  = {0};

void Factor1(int k) {
	int x = round(sqrt(k));
	for (int i = 2; i <= x; ++i) {
		int t = 0;
		while (k % i == 0) {
			k /= i;
			++t;
		}
		str[i] = max(str[i], t);
	} 
	if (k > 1) str[k] = max(str[k], 1);
}

long long expo(long long a, long long n) {
	long long ans = 1;
	for (; n; n >>= 1) {
		if (n & 1) {
			ans = (ans * a) % MOD;
		}
		a = (a * a) % MOD;
	}
	return ans;
}


int main() {
	long long ans = 0;
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);
	int n; 
	cin >> n;
	vector<int> a(n);
	for (int i = 0; i < n; ++i) cin >> a[i], Factor1(a[i]);
	long long tmp = 1;
	for (int i = 2; i <= 1e6; ++i) {
		while (str[i]--) {
			tmp = (tmp * i) % MOD;
		}
	}
	for (int i = 0; i < n; ++i) {
		ans = (ans + tmp * expo(a[i], MOD - 2) % MOD) % MOD;
	}
	cout << ans << '\n';
	return 0;
}
