#include <bits/stdc++.h>
using namespace std;
long long Pr[5000010], A[5000010], lw[5000010], S[5000010], O[5000010],
    SS[5000010], t = 0;
bool npr[5000010];
signed main() {
  for (long long i = 2; i <= 5000000; i++) {
    if (!npr[i]) Pr[++t] = i, lw[i] = i;
    for (long long j = 1; Pr[j] * i <= 5000000; j++) {
      npr[Pr[j] * i] = 1;
      lw[Pr[j] * i] = Pr[j];
      if (i % Pr[j] == 0) {
        break;
      }
    }
  }
  long long n;
  scanf("%lld", &n);
  for (long long i = 1; i <= n; i++) {
    long long a;
    scanf("%lld", &a);
    O[a]++;
  }
  for (long long i = 5000000; i >= 1; i--) {
    if (O[i] && !S[i]) S[i] = 1, SS[i] = 1, O[i]--;
    if (O[i]) {
      long long tmp = i - 1;
      while (tmp != 1) {
        long long w = lw[tmp];
        long long cnt = 0;
        while (tmp % w == 0) tmp /= w, cnt++;
        if (S[w] == cnt)
          SS[w]++;
        else if (cnt > S[w])
          SS[w] = 1;
        S[w] = max(S[w], cnt);
      }
    }
  }
  long long ans = 1;
  for (long long i = 1; i <= 5000000; i++)
    for (long long j = 1; j <= S[i]; j++) ans = ans * i % 1000000007;
  long long s = 0;
  for (long long i = 5000000; i >= 1; i--) {
    long long flag = 1;
    if (O[i] > 1)
      flag = 0;
    else if (O[i]) {
      flag = 0;
      long long tmp = i - 1;
      while (tmp != 1) {
        long long w = lw[tmp];
        long long cnt = 0;
        while (tmp % w == 0) tmp /= w, cnt++;
        if (S[w] == cnt && SS[w] == 1) flag = 1;
      }
    }
    s |= !flag;
  }
  printf("%lld\n", ((ans + s) % 1000000007 + 1000000007) % 1000000007);
  return 0;
}
