#include<bits/stdc++.h>
using namespace std;
using ll = long long;
//using LL = __int128
#define N 1111111
#define mod 1000000007ll
ll npme[N], pme[111111], pos, minp[N], n, a[N], cnt[N], val[N];
void init(int v = 1000000){
	for(int i = 2 ; i <= v ; i++){
		val[i] = 1;
		if(!npme[i]){
			pme[++pos] = i;
			minp[i] = i;
			for(ll j = 1ll * i * i ; j <= v ; j += i)
				if(!npme[j]){
					npme[j] = true;
					minp[j] = i;
				}
		}
	}
}
void g(ll x){
	unordered_map<int, ll> mp, v;
	while(x > 1){
		if(!v[minp[x]])
			v[minp[x]] = 1;
		mp[minp[x]]++;
		v[minp[x]] = (v[minp[x]] * minp[x]) % mod;
		x /= minp[x];
	}
	for(auto i : mp){
		int u = i.first, v1 = i.second, v2 = v[u];
		if(v1 > cnt[u]){
			cnt[u] = v1;
			val[u] = v2;
		}
	}
}
int main(){
	init();
	scanf("%lld", &n);
	for(int i = 1 ; i <= n ; i++){
		scanf("%lld", a + i);
		g(a[i]);
	}
	ll ans = 1;
	for(int i = 2 ; i <= 1000000 ; i++){
		ans = (ans * val[i]) % mod;
	}
	cout << ans;
	return 0;
}