#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************


vector<int> spf;

void seive(){
    spf.assign(N+1, 0);
    for(int i=2; i<=N; i++) spf[i] = i;
    for(int i=2; i*i<=N; i++){
        if(spf[i] != i) continue;
        for(int j=i*i; j<=N; j+=i){
            spf[j] = min(spf[j], i);
        }
    }
}

vector<int> a;

int consistency(int n){

    //* p -> {x, y}  , where x and y are 2 mini powers of prime p
    unordered_map<int,vector<int>> minPowers;
    unordered_map<int,int> freq;
    for(int i=0; i<n; i++){
        int val = a[i];

        while(val>1){
            int p = spf[val];
            int e = 0;

            while(val%p == 0){
                e++;
                val /= p;
            }
            freq[p]++;
            minPowers[p].push_back(e);
            sort(begin(minPowers[p]), end(minPowers[p]));
            if(minPowers[p].size() > 3) minPowers[p].pop_back();
        }

    }

    int ans = 1;
    for(auto& q : minPowers){
        int p = q.first;
        auto exp = q.second;

        int e = 0;

        if(freq[p] == n) e = max(exp[0], exp[1]);
        else if(freq[p] == n-1) e = exp[0];
        
        if(e!=0){
            ans *= pow(p, e);
        }
    }

    return ans;
}















int practice(int n){


    return 0;
}





void solve() {

    static int _ = (seive(), 0);
    
    int n;
    cin>> n;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    cout << consistency(n) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}