#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 50;
const long long mod = 1e9 + 7;
inline long long Pow(long long x, long long exp) {
  long long res = 1;
  for (; exp; exp >>= 1, x = x * x % mod)
    if (exp & 1) res = res * x % mod;
  return res;
}
int pri[N / 3], m;
bool notp[N];
vector<int> divi[N];
inline void Init() {
  for (int i = 2; i < N; i++) divi[i].reserve(8);
  for (int i = 2; i < N; i++)
    if (!notp[i]) {
      pri[++m] = i;
      divi[i].push_back(i);
      for (int j = i + i; j < N; j += i) {
        notp[j] = 1;
        divi[j].push_back(i);
      }
    }
}
int n, a[N], cnt[N], num[N], state[N];
inline void Insert(int x) {
  int t = x;
  for (auto i : divi[x]) {
    int c = 0;
    while (t % i == 0) {
      t /= i;
      c++;
    }
    if (cnt[i] < c)
      cnt[i] = c, num[i] = 1;
    else if (cnt[i] == c)
      num[i]++;
  }
}
inline bool check(int x) {
  int t = x;
  for (auto i : divi[x]) {
    int c = 0;
    while (t % i == 0) {
      t /= i;
      c++;
    }
    if (cnt[i] == c && num[i] == 1) return 0;
  }
  return 1;
}
int main() {
  Init();
  scanf("%d", &n);
  for (int i = 1, x; i <= n; i++) {
    scanf("%d", &x);
    a[x]++;
  }
  bool add = 0;
  for (int i = 1; i < N; i++) {
    if (a[i] > 2) add = 1;
    if (a[i] >= 2) {
      Insert(i);
      Insert(i - 1);
      state[i] = 3;
    }
  }
  for (int i = N - 1; i; i--)
    if (a[i] == 1) {
      if (cnt[i])
        Insert(i - 1), state[i] = 1;
      else
        Insert(i), state[i] = 2;
    }
  for (int i = 1; i < N && !add; i++) {
    if (state[i] & 1) add |= check(i - 1);
    if (state[i] & 2) add |= check(i);
  }
  long long ans = 1;
  for (int i = 2; i < N; i++)
    if (cnt[i]) ans = ans * Pow(i, cnt[i]) % mod;
  printf("%lld\n", (ans + add) % mod);
  return 0;
}
