#include<bits/stdc++.h>
using namespace std;
#define int long long
int n;
int a[1000005];
int pr[1000005];
int pw[1000005];
vector<pair<int,int> > dv[1000005];
int l;
bool b[1000005];
const int mod=1e9+7;
int qkp(int b,int p){
	if(p==0)return 1;
	int r=1;
	while(p){
		if(p&1)(r*=b)%=mod;
		(b*=b)%=mod;
		p/=2;
	}
	return r;
}
signed main(){
	for(int i=2;i<=1000000;i++){
		if(!b[i]){
			dv[i].push_back({i,1});
			pr[++l]=i;
			for(int j=i*2;j<=1000000;j+=i){
				b[j]=1;
				int x=j;
				int p=0;
				while(x%i==0){x/=i,p++;}
				dv[j].push_back({i,p});
			}
		}
	}
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	for(int i=1;i<=n;i++){
		for(int j=0;j<(int)dv[a[i]].size();j++)pw[dv[a[i]][j].first]=max(pw[dv[a[i]][j].first],dv[a[i]][j].second);
	}
	int res=1;
	for(int i=1;i<=1000000;i++){
		//if(pw[i])cout<<i<<" "<<pw[i]<<"\n";
		res*=qkp(i,pw[i]);res%=mod;
	}
	cout<<res;
	return 0;
}