#include <bits/stdc++.h>
int prime[262144], nprime;
int min_factor[2097152];
void euler_siece() {
  for (int i = 2; i < 2097152; ++i) {
    if (!min_factor[i]) prime[nprime++] = i, min_factor[i] = i;
    for (int j = 0; i * prime[j] < 2097152; ++j) {
      min_factor[i * prime[j]] = prime[j];
      if (i % prime[j] == 0) break;
    }
  }
  0;
}
int pow(int x, int n, int m) {
  int res = 1;
  while (n) {
    if (n & 1) res = (long long int)res * x % m;
    x = (long long int)x * x % m;
    n >>= 1;
  }
  return res;
}
int a[262144];
int f[2097152], c[2097152];
int main() {
  euler_siece();
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) scanf("%d", a + i);
  std::sort(a, a + n, std::greater<int>());
  for (int i = 0; i < n; ++i) {
    int k = a[i] -= !!f[a[i]];
    while (k != 1) {
      int d = min_factor[k], cnt = 0;
      while (k % d == 0) k /= d, ++cnt;
      if (f[d] == cnt)
        ++c[d];
      else if (f[d] < cnt)
        f[d] = cnt, c[d] = 1;
    }
  }
  int ans = 1;
  for (int i = 0; i < 2097152; ++i)
    if (f[i])
      ans = (long long int)ans * pow(i, f[i], ((int)1e9 + 7)) % ((int)1e9 + 7);
  for (int i = 0; i < n; ++i) {
    int k = a[i];
    while (k != 1) {
      int d = min_factor[k], cnt = 0;
      while (k % d == 0) k /= d, ++cnt;
      if (cnt == f[d] && c[d] == 1) goto tag_cont;
    }
    ans = (ans + 1) % ((int)1e9 + 7);
    break;
  tag_cont:
    0;
  }
  printf("%d\n", ans);
  return 0;
}
