#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 1e9 + 7;

void solve() {
	int n;
	cin >> n;
	vector<int> aa(n + 1);
	for(int i = 1; i <= n; i ++) {
		cin >> aa[i];
	}
	if(n == 1) {
		cout << 1 << '\n';
		return;
	}
	int ans;
	int h = __gcd(aa[1], aa[2]);
	ans = aa[1] * aa[2] / h / h % mod;
	int pre = aa[1] / h;
	for(int i = 2; i < n; i ++) {
		int g = __gcd(aa[i], aa[i + 1]);
		int x = aa[i] / g, y = aa[i + 1] / g;
		int z = pre;
		int g1 = __gcd(x, z), g2 = __gcd(y, z);
		z /= g1, z /= g2, x /= g1, y /= g2;
		pre = z * x * y;
		ans = ans * pre % mod;
	}
	cout << ans << '\n';
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int _ = 1;
//	cin >> _;
	while(_ --) solve();
	return 0;
}