#include <bits/stdc++.h>
using namespace std;
long long d[11000000], a[11000000];
bool v[11000000];
long long ans, sum;
int n;
long long gao(long long x, long long y) {
  long long l = x, r = sum, mid, now, tmp;
  while (l <= r) {
    mid = (l + r) / 2;
    now = 0;
    tmp = mid;
    while (tmp > 0) {
      now += tmp / x;
      tmp /= x;
    }
    if (now >= y)
      r = mid - 1;
    else
      l = mid + 1;
  }
  return r + 1;
}
int main() {
  long long i, j, k;
  int x;
  scanf("%d", &n);
  for (i = 1; i <= n; i++) {
    scanf("%d", &x);
    sum += x;
    d[2]++;
    d[x + 1]--;
  }
  partial_sum(d, d + 11000000, d);
  for (i = 2; i < 11000000; i++)
    if (!v[i])
      for (j = i; j < 11000000; j *= i)
        for (k = j; k < 11000000; k += j) {
          v[k] = true;
          a[i] += d[k];
        }
  ans = 1;
  for (i = 2; i < 11000000; i++)
    if (a[i] > 0) ans = max(ans, gao(i, a[i]));
  printf("%I64d", ans);
}
