Problem: In a far away galaxy there is war again. The treacherous Republic made k precision strikes of power ai on the Empire possessions. To cope with the republican threat, the Supreme Council decided to deal a decisive blow to the enemy forces. 

To successfully complete the conflict, the confrontation balance after the blow should be a positive integer. The balance of confrontation is a number that looks like <image>, where p = n! (n is the power of the Imperial strike), <image>. After many years of war the Empire's resources are low. So to reduce the costs, n should be a minimum positive integer that is approved by the commanders.

Help the Empire, find the minimum positive integer n, where the described fraction is a positive integer.

Input

The first line contains integer k (1 ≤ k ≤ 106). The second line contains k integers a1, a2, ..., ak (1 ≤ ai ≤ 107).

Output

Print the minimum positive integer n, needed for the Empire to win.

Please, do not use the %lld to read or write 64-but integers in С++. It is preferred to use the cin, cout streams or the %I64d specificator.

Examples

Input

2
1000 1000


Output

2000

Input

1
2


Output

2

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  vector<int> Fact(1e7 + 1);
  for (int n = 2; n <= 3162; ++n) {
    if (!Fact[n]) {
      for (int m = n * n; m <= 1e7; m += n) {
        Fact[m] = n;
      }
    }
  }
  int N, t;
  cin >> N;
  vector<long long> Count(1e7 + 2);
  while (N--) {
    cin >> t;
    ++Count[t];
  }
  for (int n = 1e7; n >= 2; --n) {
    Count[n] += Count[n + 1];
  }
  for (int n = 1e7; n >= 2; --n) {
    if (Fact[n]) {
      Count[Fact[n]] += Count[n];
      Count[n / Fact[n]] += Count[n];
      Count[n] = 0;
    }
  }
  long long Ans = 1;
  long long x, y, temp;
  for (int n = 2; n <= 1e7; ++n) {
    if (Ans >= Count[n] * n) {
      continue;
    }
    x = max(Ans, Count[n] * (n - 1)) / n * n;
    y = 0;
    for (temp = x / n; temp > 0; temp /= n) {
      y += temp;
    }
    while (y < Count[n]) {
      x += n;
      ++y;
      for (temp = x / n; temp % n == 0; temp /= n) {
        ++y;
      }
    }
    Ans = max(Ans, x);
  }
  cout << Ans << endl;
  return 0;
}