#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void gmin(T &x, const T &y) {
  x = x > y ? y : x;
}
template <class T>
inline void gmax(T &x, const T &y) {
  x = x < y ? y : x;
}
template <class T>
inline bool Gmin(T &x, const T &y) {
  return x > y ? x = y, 1 : 0;
}
template <class T>
inline bool Gmax(T &x, const T &y) {
  return x < y ? x = y, 1 : 0;
}
const int BufferSize = 1 << 16;
char buffer[BufferSize], *Bufferhead, *Buffertail;
bool Terminal;
inline char Getchar() {
  if (Bufferhead == Buffertail) {
    int l = fread(buffer, 1, BufferSize, stdin);
    if (!l) {
      Terminal = 1;
      return 0;
    }
    Buffertail = (Bufferhead = buffer) + l;
  }
  return *Bufferhead++;
}
template <class T>
inline bool read(T &x) {
  x = 0;
  char c = Getchar(), rev = 0;
  while (c < '0' || c > '9') {
    rev |= c == '-';
    c = Getchar();
    if (Terminal) return 0;
  }
  while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = Getchar();
  if (c == '.') {
    c = Getchar();
    double t = 0.1;
    while (c >= '0' && c <= '9')
      x = x + (c - '0') * t, c = Getchar(), t = t / 10;
  }
  x = rev ? -x : x;
  return 1;
}
template <class T1, class T2>
inline bool read(T1 &x, T2 &y) {
  return read(x) & read(y);
}
template <class T1, class T2, class T3>
inline bool read(T1 &x, T2 &y, T3 &z) {
  return read(x) & read(y) & read(z);
}
template <class T1, class T2, class T3, class T4>
inline bool read(T1 &x, T2 &y, T3 &z, T4 &w) {
  return read(x) & read(y) & read(z) & read(w);
}
inline bool reads(char *x) {
  char c = Getchar();
  while (c < 33 || c > 126) {
    c = Getchar();
    if (Terminal) return 0;
  }
  while (c >= 33 && c <= 126) (*x++) = c, c = Getchar();
  *x = 0;
  return 1;
}
template <class T>
inline void print(T x, const char c = '\n') {
  if (!x) {
    putchar('0');
    putchar(c);
    return;
  }
  if (x < 0) putchar('-'), x = -x;
  int m = 0, a[20];
  while (x) a[m++] = x % 10, x /= 10;
  while (m--) putchar(a[m] + '0');
  putchar(c);
}
const int inf = 0x3f3f3f3f;
const int N = 200005, M = 2000005, mod = 1e9 + 7;
template <class T, class S>
inline void ch(T &x, const S y) {
  x = (x + y) % mod;
}
inline int exp(int x, int y, const int mod = ::mod) {
  int ans = 1;
  while (y) {
    if (y & 1) ans = (long long)ans * x % mod;
    x = (long long)x * x % mod;
    y >>= 1;
  }
  return ans;
}
int n, a[N], tag[M], bad[M];
vector<int> g[N];
void prepare() {
  static int tot, p[M / 5];
  static bool vis[M];
  int n = M - 5;
  for (int i = 2; i <= n; i++) {
    if (!vis[i]) {
      p[++tot] = i;
      tag[i] = i;
    }
    for (int j = 1; j <= tot && p[j] * i <= n; j++) {
      vis[p[j] * i] = 1;
      tag[p[j] * i] = p[j];
      if (i % p[j] == 0) break;
    }
  }
}
inline void upt(int x, vector<int> &g) {
  while (x ^ 1) {
    int t = 1, p = tag[x];
    while (x % p == 0) {
      t *= p;
      x /= p;
      g.push_back(t);
      bad[t]++;
    }
  }
}
int main() {
  prepare();
  read(n);
  for (int i = 1; i <= n; i++) read(a[i]);
  sort(a + 1, a + n + 1);
  bool isok = 1;
  for (int i = n; i; i--)
    if (!bad[a[i]])
      upt(a[i], g[i]);
    else
      upt(a[i] - 1, g[i]);
  int ans = 1;
  for (int i = 2; i <= M - 5; i++)
    if (bad[i]) ans = (long long)ans * tag[i] % mod;
  for (int i = 1; i <= n; i++) {
    bool isok = 1;
    for (int j : g[i])
      if (bad[j] == 1) {
        isok = 0;
        break;
      }
    if (isok) {
      ch(ans, 1);
      break;
    }
  }
  printf("%d\n", ans);
  return 0;
}
