#include <bits/stdc++.h>
using namespace std;
int i, j, k, n, m, ma;
int p[1000010], f[1000010 * 10], a[1000010], s[1000010 * 10];
long long g[1000010], an;
inline void prepare() {
  int i, j;
  for (i = 2; i <= ma; i++) {
    if (!f[i]) p[++*p] = i, f[i] = *p;
    for (j = 1; j <= f[i] && i * p[j] <= ma; j++) f[i * p[j]] = j;
  }
  for (i = 1; i <= n; i++) s[a[i]]++;
  for (i = ma; i; i--) s[i] += s[i + 1];
  for (i = 1; i <= ma; i++) {
    for (j = i; j > 1; j /= p[f[j]]) g[f[j]] += s[i];
  }
}
inline void work() {
  int i;
  long long l, r, mid, s, k;
  an = 1;
  for (i = 1; i <= *p; i++) {
    l = 1, r = (long long)1e14;
    for (; l <= r;) {
      mid = (l + r) / 2;
      for (s = 0, k = mid / p[i]; k; k /= p[i]) s += k;
      if (s < g[i])
        l = mid + 1;
      else
        r = mid - 1;
    }
    an = max(an, r + 1);
  }
  printf("%I64d\n", an);
}
int main() {
  scanf("%d", &n);
  for (i = 1; i <= n; i++) scanf("%d", &a[i]), ma = max(ma, a[i]);
  prepare();
  work();
  return 0;
}
