#include <bits/stdc++.h>
using namespace std;
const int N = 2000009;
int lp[N + 1];
vector<int> pr;
void compute() {
  for (int i = 2; i <= N; ++i) {
    if (lp[i] == 0) {
      lp[i] = i;
      pr.push_back(i);
    }
    for (int j = 0; j < (int)pr.size() && pr[j] <= lp[i] && i * pr[j] <= N; ++j)
      lp[i * pr[j]] = pr[j];
  }
}
map<int, int> power, freq;
int arr[301009];
bool repeated[301009];
int main() {
  compute();
  int n, v, f;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
  sort(arr, arr + n);
  reverse(arr, arr + n);
  long long ans = 1;
  for (int i = 0; i < n; i++) {
    v = arr[i];
    if (power.count(v) == 0) {
      power[v] = 1;
      freq[v] = 1;
    } else {
      repeated[i] = true;
      v--;
      while (v != 1) {
        int k = lp[v], f = 0;
        while (v % k == 0) {
          v /= k;
          f++;
        }
        if (power.count(k) == 0 || power[k] < f) {
          power[k] = f;
          freq[k] = 1;
        } else if (power[k] == f)
          freq[k]++;
      }
    }
  }
  for (auto& k : power) {
    v = k.first, f = k.second;
    while (f > 0) {
      ans = (ans * v) % 1000000007;
      f--;
    }
  }
  bool add = false;
  for (int i = 0; i < n; i++) {
    v = arr[i];
    if (repeated[i] == false) {
      if (power[v] > 1 || freq[v] > 1) {
        add = true;
        break;
      }
    } else {
      v--;
      bool ok = true;
      while (v != 1) {
        int k = lp[v], f = 0;
        while (v % k == 0) {
          v /= k;
          f++;
        }
        if (power[k] > f || (power[k] == f && freq[k] > 1))
          ;
        else
          ok = false;
      }
      if (ok) {
        add = true;
        break;
      }
    }
  }
  printf("%lld\n", (ans + (add ? 1 : 0)) % 1000000007);
  return 0;
}
