#include <bits/stdc++.h>
using namespace std;

#define QwQ3301AwA return 0
#define ll long long

const int N = 1e6 + 5;
const int mod = 1e9 + 7;
int n;
int p[N], cnt, id[N];
bool vis[N];
int mx[N];

void init(int lim) {
    for (int i = 2; i <= lim; i++) {
        if (!vis[i]) p[++cnt] = i, id[i] = cnt;
        for (int j = 1; j <= cnt && 1ll * i * p[j] <= lim; j++) {
            vis[i * p[j]] = 1;
            if (i % p[j] == 0) break;
        }
    }
}

int ksm(int a, int b) {
    int ans = 1;
    for (; b; b >>= 1, a = 1ll * a * a % mod) {
        if (b & 1) ans = 1ll * ans * a % mod;
    }
    return ans;
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    init(1e6);
    // cout << cnt << '\n';
    cin >> n;
    for (int i = 1; i <= n; i++) {
        int w;
        cin >> w;
        for (int j = 1; j <= cnt && 1ll * p[j] * p[j] <= w; j++) {
            if (w % p[j] == 0) {
                int cnt = 0;
                while (w % p[j] == 0) w /= p[j], cnt++;
                mx[j] = max(mx[j], cnt);
                // cout << p[j] << ' ' << cnt << '\n';
            }
        }
        if (w != 1) mx[id[w]] = max(mx[id[w]], 1);
    }
    int ans = 1;
    for (int i = 1; i <= cnt; i++) {
        if (mx[i] == 0) continue;
        ans = 1ll * ans * ksm(p[i], mx[i]) % mod;
    }
    cout << ans << '\n';
    QwQ3301AwA;
}