Find the least common multiple (LCM) of given n integers.

Constraints

* 2 ≤ n ≤ 10
* 1 ≤ ai ≤ 1000
* Product of given integers ai(i = 1, 2, ... n) does not exceed 231-1

Input


n
a1 a2 ... an


n is given in the first line. Then, n integers are given in the second line.

Output

Print the least common multiple of the given integers in a line.

Examples

Input

3
3 4 6


Output

12


Input

4
1 2 3 5


Output

30
#define _CRT_SECURE_NO_WARNINGS

#include<fstream>
#include<iostream>
#include<string>
#include<iomanip>
#include<list>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<utility>

using namespace std;

int main(int argc, char **argv){
	int n;
	int a;
	int lcm = 1;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> a;
		for (int j = 1; j <= lcm; j++) {
			if ((a * j) % lcm == 0) {
				lcm = a * j;
				break;
			}
		}
	}
	cout << lcm << endl;
	return 0;
}