#include <vector>
#include <iostream>
#include <algorithm>

using namespace std;

long long GCD(long long a, long long b)
{
	if (max(a, b) % min(a, b) == 0) { return min(a, b); }

	return GCD(min(a, b), max(a, b) % min(a, b));
}

long long LCM(long long a, long long b)
{
	return a / GCD(a, b) * b;
}

int main()
{
	int N; cin >> N;

	vector<int> a(N);

	for (int i = 0; i < N; i++)
		cin >> a[i];

	for (int i = 1; i < N; i++)
		a[i] = LCM(a[i], a[i - 1]);

	cout << a[N - 1] << endl;

	return 0;
}