#include <iostream>
#include <vector>
#include <queue>
#include <cstdio>
#include <algorithm>
#include <set>
#include <cstring>
#include <string>
#include <cmath>
#include <map>
#include <stack>
#include <ctime>
using namespace std;
typedef unsigned long long LL;
const LL INF=987654321;
const LL MOD=1e9+7;
const int N=1000010;
typedef pair<int,int> P;
LL gcd(LL a,LL b){
	return b==0?a:gcd(b,a%b);
}
LL a[N];
int main(void)
{
//	freopen("in.txt","r",stdin);
	int n,m;
	while(cin>>n){
		for(int i=0;i<n;i++)
			cin>>a[i];
		LL ans=1;
		for(int i=0;i<n;i++){
			LL t=gcd(a[i],ans);
		//	cout<<t<<"#"<<endl;
			ans=ans/t*a[i];
		}
		cout<<ans<<endl;
	}
    return 0;
}