#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
 
#define rep(i,n) for(int i = 0;i<n;i++)
const long long MOD = 1000000007;

int gcd(int a, int b){
  int tmp = 1;
  while(tmp != 0){
    tmp =  a%b;
    a = b;
    b = tmp;
  }
  return a;
}

int main(){
  int n;cin >> n;
  long long ans; cin >> ans;
  for(int i = 0; i<n-1; i++){
    int ai; cin >> ai;
    ans = (ans*ai)/gcd(ans,ai);
  }
  cout << ans << endl;
}
