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 <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>

using namespace std;

int main()
{
	int n;
	int a[10];
	int max = 0;

	cin >> n;

	for (int i = 0; i < n; i++) {
		cin >> a[i];
		if (max < a[i]) {
			max = a[i];
		}
	}
	int j = 1;
	int x = max;
	while (1) {
		for (int i = 0; i < n; i++) {
			if (x % a[i] != 0) {
				break;
			}
			if (i == n - 1) {
				cout << x << endl;
				return 0;
			}
		}
		j++;
		x = max * j;
	} 

	return (0);
}