90分求调，回者必关

#include<bits/stdc++.h>

using namespace std;
long long LCM=1,n,a[11];
long long lcm(int x,int y){
	return x*y/__gcd(x,y);
}

signed main()
{
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		LCM=lcm(a[i],LCM);
	}
	cout<<LCM<<endl;
    return 0;
}