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


int a[10];

int LCM(int n, int m){
  if (n == 0) return m;
  return LCM(m % n, n);
}

int main()
{
  int n;

  cin >> n;

  for (int i = 0; i < n; i++){
    cin >> a[i];
  }
  sort(a, a + n);

  for (int i = n - 1; i > 0; i--){
    a[i - 1] *= a[i] / LCM(a[i - 1], a[i]);
  }

  cout << a[0] << endl;

  return 0;
}