#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1000006;
const int M = 10000007;
int k, a[N];
int lp[M];
ll cnt[M];
int p[M], sz;
bool f(ll x) {
  for (int i = 0; i < sz; i++) {
    ll tmp = x;
    ll fac = 0;
    while (tmp) {
      tmp /= p[i];
      fac += tmp;
    }
    if (fac < cnt[p[i]]) return false;
  }
  return true;
}
int main() {
  for (int i = 2; i * i < M; i++)
    if (!lp[i]) {
      for (int j = i * i; j < M; j += i)
        if (!lp[j]) {
          lp[j] = i;
        }
    }
  for (int i = 2; i < M; i++) {
    if (!lp[i]) lp[i] = i;
    if (lp[i] == i) p[sz++] = i;
  }
  scanf("%d", &k);
  for (int i = 0; i < k; i++) scanf("%d", a + i);
  sort(a, a + k);
  for (int i = 0; i < k; i++) cnt[a[i]]++;
  for (int i = M - 2; i >= 0; i--) cnt[i] += cnt[i + 1];
  for (int i = M - 1; i >= 2; i--)
    if (lp[i] != i and cnt[i]) {
      int x = lp[i], b = i / x;
      cnt[x] += cnt[i];
      cnt[b] += cnt[i];
      cnt[i] = 0;
    }
  while (sz > 0 and cnt[p[sz - 1]] == 0) sz--;
  ll lo = 1, hi = 1e16, ans = -1;
  while (lo <= hi) {
    ll mid = (lo + hi) / 2;
    if (f(mid))
      ans = mid, hi = mid - 1;
    else
      lo = mid + 1;
  }
  printf("%lld\n", ans);
}
