#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2000001, MOD = 1e9 + 7;
int lcm[MAXN] = {0}, cnt[MAXN] = {0}, add = 0, pre[MAXN] = {0};
bool add_as[MAXN] = {0};
void go(long long p, int idx) {
  if (not lcm[p]) return ++lcm[p], void();
  add_as[idx] = true;
  bool upd = false;
  long long n = p - 1;
  for (; n != 1;) {
    long long d = pre[n], t = 0;
    while (n % d == 0) ++t, n /= d;
    if (lcm[d] < t)
      lcm[d] = t, cnt[d] = 1, upd = true;
    else if (lcm[d] == t)
      ++cnt[d];
  }
  if (not upd) add = 1;
}
bool check(long long p, int idx) {
  long long n = p - 1;
  bool necessary = false;
  for (; n != 1;) {
    long long d = pre[n], t = 0;
    while (n % d == 0) ++t, n /= d;
    if (lcm[d] == t and cnt[d] == 1) necessary = true;
  }
  if (not necessary) add = 1;
}
long long powmod(long long x, long long k) {
  long long ans = 1;
  for (long long cur = x % MOD; k; k >>= 1, cur = cur * cur % MOD) {
    if (k & 1) ans = cur * ans % MOD;
  }
  return ans;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<long long> p(n);
  for (int i = 0; i < n; ++i) cin >> p[i];
  for (int p = 2; p < MAXN; ++p)
    for (int n = p; n < MAXN; n += p)
      if (not pre[n]) {
        pre[n] = p;
      }
  sort(p.rbegin(), p.rend());
  for (int i = 0; i < n; ++i) go(p[i], i);
  for (int i = 0; i < n; ++i)
    if (add_as[i]) check(p[i], i);
  long long ans = 1;
  for (int i = 1; i < MAXN; ++i) (ans *= powmod(i, lcm[i])) %= MOD;
  (ans += add) %= MOD;
  cout << ans << '\n';
}
