Lowest Common Multiple Plus

#include <iostream>
#include <cstdio>
using namespace std;

long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a%b); }
long long lcm(long long a, long long b) {return a*b / gcd(a, b);}

int main()
{
int n;
long long ans,a;
while (scanf("%d", &n) != EOF) {
long long sum=1;
for (int i = 0;i < n;i++) {
scanf("%lld",&a);
sum=lcm(sum, a);

}
printf("%lld\n",sum);
}
return 0;
}