#include <bits/stdc++.h>
using namespace std;
const int N = int(1e7) + 5;
int pr[N];
vector<int> primes;
unsigned long long P[N];
bool PODHODIT(unsigned long long n) {
  for (int i = 0; i < primes.size(); i++) {
    unsigned long long sn = n;
    unsigned long long counter = 0;
    while (sn) {
      sn /= primes[i];
      counter += sn;
    }
    if (counter < P[primes[i]]) return false;
  }
  return true;
}
int main() {
  ios::sync_with_stdio(false);
  for (int i = 2; i <= N; i++) {
    if (!pr[i]) {
      primes.push_back(i);
      pr[i] = i;
    }
    for (int j = 0;
         j < primes.size() && i * primes[j] <= N && pr[i] >= primes[j]; j++)
      pr[i * primes[j]] = primes[j];
  }
  int n;
  cin >> n;
  unsigned long long rg = 0, lg = 0;
  for (int i = 0; i < n; i++) {
    int inp;
    cin >> inp;
    rg += inp;
    P[inp]++;
  }
  for (int i = N - 2; i >= 2; i--) P[i] += P[i + 1];
  for (int i = N - 1; i >= 2; i--) {
    if (pr[i] == i) continue;
    P[pr[i]] += P[i];
    P[i / pr[i]] += P[i];
    P[i] = 0;
  }
  while (lg < rg) {
    unsigned long long mid = (lg + rg) / 2;
    if (PODHODIT(mid))
      rg = mid;
    else
      lg = mid + 1;
  }
  cout << (rg ? rg : 1) << endl;
  return 0;
}
