#include <bits/stdc++.h>
using namespace std;
const int N = 1e7 + 6;
int low[N], isp[N];
vector<int> pri;
void getprime() {
  fill_n(isp + 2, N - 2, 1);
  for (int i = (2); i < (N); ++i) {
    if (isp[i]) pri.push_back(i);
    for (auto p : pri) {
      if (p * i >= N) break;
      low[p * i] = p;
      isp[p * i] = 0;
      if (i % p == 0) break;
    }
  }
}
int n, a[N];
long long cnt[N];
bool ck(long long mid) {
  for (auto p : pri) {
    long long ned = cnt[p];
    for (long long tmp = mid / p; tmp; tmp /= p) ned -= tmp;
    if (ned > 0) return 0;
  }
  return 1;
}
int main() {
  getprime();
  scanf("%d", &n);
  for (int i = (0); i < (n); ++i) {
    scanf("%d", a + i);
    cnt[a[i]]++;
  }
  for (int i = (N - 1) - 1; i >= (2); --i) cnt[i] += cnt[i + 1];
  for (int i = (N - 1) - 1; i >= (2); --i)
    if (!isp[i]) {
      cnt[low[i]] += cnt[i];
      cnt[i / low[i]] += cnt[i];
    }
  long long l = 1, r = 0, ans;
  for (int i = (0); i < (n); ++i) r += a[i];
  for (long long mid = l + r >> 1; l <= r; mid = l + r >> 1)
    ck(mid) ? r = (ans = mid) - 1 : l = mid + 1;
  printf("%lld\n", ans);
  return 0;
}
