a,b的最小公倍数=a*b/最大公约数
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
while (in.hasNext()){
int n=in.nextInt();
long first=in.nextInt();
while (n-->1){
long m=in.nextInt();
first=multiple(first,m);
}
System.out.println(first);
}
}
//最小公约数
public static long gcd_1 (long a,long b)
{
if(a%b==0)
return b;
else
return gcd_1(b,a%b);
}
//最小公倍数
public static long multiple(long a,long b){
long temp=gcd_1(a,b);
return (a*b)/temp;
}
}