#include <iostream>
#include <cstring> 
#include <cmath>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <iomanip>
#include <map>
#include <queue>
#include <set> 
#define ll long long
using namespace std;
ll A[1000000];
int main()
{
    ll n,i,j,minn = 0;
    cin >> n;
    for(i = 1;i <= n;i++)
    {
    	cin >> A[i];
	}
	sort(A + 1,A + n + 1);
	for(i = 1;i <= n - 1;i++)
	{
		for(j = 1;j <= A[i] * A[i + 1];j++)
		{
			if(j % A[i] == 0 && j % A[i + 1] == 0)
			{
				minn = j;
				break;
			}
		}
	}
	cout << minn;
    return 0;
}