#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int cnt[2000005];
bool gt[2000005];
bool com[2000005], nd[2000005];
int main() {
  int n, x;
  bool mo1 = false;
  scanf("%d", &n);
  for (int i = 0; i < (int)(n); i++) {
    scanf("%d", &x);
    cnt[x]++;
  }
  for (int i = 2000000; i >= 1; i--) {
    if (cnt[i] == 0) continue;
    if (cnt[i] > 2) mo1 = true;
    bool hv = false;
    for (int j = i; j <= 2000000; j += i)
      if (gt[j]) hv = true;
    if (hv || cnt[i] > 1) gt[i - 1] = true;
    if (!hv || cnt[i] > 1) gt[i] = true;
  }
  long long ans = 1;
  for (int i = 2; i <= 2000000; i++) {
    if (com[i]) continue;
    int tot = 0, tt = 0;
    for (int j = i; j <= 2000000; j += i) {
      if (!gt[j]) continue;
      int cnt = 0, cj = j;
      do {
        cj /= i;
        cnt++;
      } while (cj % i == 0);
      tot = max(tot, cnt);
    }
    for (int j = i; j <= 2000000; j += i) {
      if (!gt[j]) continue;
      int cnt = 0, cj = j;
      do {
        cj /= i;
        cnt++;
      } while (cj % i == 0);
      if (tot == cnt) tt++;
    }
    for (int j = i; j <= 2000000; j += i) {
      if (!gt[j]) continue;
      int cnt = 0, cj = j;
      do {
        cj /= i;
        cnt++;
      } while (cj % i == 0);
      if (tot == cnt && tt == 1) nd[j] = true;
    }
    for (int j = 0; j < (int)(tot); j++) ans = ans * i % MOD;
    for (int j = i + i; j <= 2000000; j += i) com[j] = true;
  }
  for (int i = 1; i <= 2000000; i++)
    if (gt[i] && !nd[i]) mo1 = true;
  printf("%I64d\n", (ans + mo1) % MOD);
  return 0;
}
