#include <bits/stdc++.h>
using namespace std;
const int NS = 1000100;
const int MS = 10000010;
int n, t;
int a[MS], b[MS];
int minp[MS], pri[MS], pos[MS], top = 0;
long long c[MS];
void prime_table() {
  for (int i = 2; i < MS; i++) {
    if (!minp[i]) {
      pri[top] = i;
      pos[i] = top++;
      for (int j = i; j < MS; j += i)
        if (!minp[j]) minp[j] = i;
    }
  }
}
int main() {
  prime_table();
  while (~scanf("%d", &n)) {
    memset(a, 0, sizeof(a));
    memset(b, 0, sizeof(b));
    memset(c, 0, sizeof(c));
    for (int i = 0; i < n; i++) scanf("%d", &t), a[t]++;
    for (int i = MS - 10; i > 1; i--) {
      c[pos[minp[i]]] += a[i] + b[i];
      b[i / minp[i]] += a[i] + b[i];
      a[i - 1] += a[i];
    }
    long long temp, s, mid, down = 1, up = 10000000000000LL;
    while (down < up) {
      t = 1;
      mid = (down + up) >> 1;
      for (int i = 0; i < top; i++) {
        s = 0, temp = mid;
        while (temp >= pri[i]) temp /= pri[i], s += temp;
        if (s < c[i]) {
          t = 0;
          break;
        }
      }
      if (t > 0)
        up = mid;
      else
        down = mid + 1;
    }
    printf("%I64d\n", up);
  }
  return 0;
}
