#include <bits/stdc++.h>
const int N = 1000000 + 5;
const int _M = 10000000 + 5;
const int _p = 670000;
int vis[_M];
int prime[_p], dep;
long long cnt[_M], INF;
void prepare() {
  vis[1] = 1;
  for (int i = 2; i < _M; ++i)
    if (!vis[i]) {
      prime[dep++] = i;
      vis[i] = i;
      if ((long long)i * i >= _M) continue;
      for (int j = i * i; j < _M; j += i) vis[j] = i;
    }
}
bool num(long long x, int y, long long z) {
  long long re = 0;
  while (x > 1) {
    x /= y;
    re += x;
    if (re >= z) return true;
  }
  return re >= z;
}
long long get(int x, long long y) {
  long long l = 0, r = INF, mid;
  while (r - l > 1) {
    mid = (l + r) / 2;
    if (num(mid, x, y))
      r = mid;
    else
      l = mid;
  }
  return r;
}
int main() {
  prepare();
  int n, a;
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &a);
    INF += a;
    ++cnt[a];
  }
  int b;
  for (int i = _M - 1; i >= 1; --i) cnt[i - 1] += cnt[i];
  for (int i = _M - 1; i > 1; --i)
    if (cnt[i] > 0 && vis[i] != i) {
      b = vis[i];
      cnt[b] += cnt[i];
      cnt[i / b] += cnt[i];
      cnt[i] = 0;
    }
  long long ans = 1;
  for (int i = 0; i < dep; ++i)
    if (cnt[prime[i]] > 0) ans = std::max(ans, get(prime[i], cnt[prime[i]]));
  std::cout << ans << std::endl;
  return 0;
}
