// Original C++ solution (slower):
#include <bits/stdc++.h>

using namespace std;



#define NDEBUG

#include <cassert>





typedef long long ll;

typedef long double Double;

typedef unsigned long long ull;

typedef pair<int,int> ii;

typedef pair<ll,ll> llll;

typedef pair<double,double> dd;



typedef vector<int> vi;

typedef vector<vector<int>> vvi;

typedef vector<ii> vii;

typedef vector<vector<ii>> vvii;

typedef vector<ll> vll;

typedef vector<string> vs;

typedef vector<double> vd;

typedef vector<long double> vD;



#define sz(a)  int((a).size())

#define pb  push_back

#define eb  emplace_back

#define FOR(var,from,to) for(int var=(from);var<=(to);++var)

#define rep(var,n)  for(int var=0;var<(n);++var)

#define rep1(var,n)  for(int var=1;var<=(n);++var)

#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)

#define ALL(c)  (c).begin(),(c).end()

#define RALL(c)  (c).rbegin(),(c).rend()

#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)

#define found(s,e)  ((s).find(e)!=(s).end())

#define mset(arr,val)  memset(arr,val,sizeof(arr))

#define mid(x,y) ((x)+((y)-(x))/2)

#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))

#define cons make_pair



#define PQ(T) priority_queue<T>

#define RPQ(T) priority_queue<T,vector<T>,greater<T>>



template<class T> inline void amin(T & a, T const & b) { a = min(a, b); }

template<class T> inline void amax(T & a, T const & b) { a = max(a, b); }



inline ll square(ll x) { return x * x; }

inline ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }

template <typename T>

inline T mod(T a, T b) { return ((a % b) + b) % b; }





const ll MOD=1000000007LL;



ll ADD(ll x, ll y) { return (x+y) % MOD; }

ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }

ll MUL(ll x, ll y) { return x*y % MOD; }

ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }

ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }



#define INTSPACE 12

char _buf[INTSPACE*1000000 + 3];



int loadint() {

    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;

    return atoi(_buf);

}



int loadvec(vector<int>& v, int N=-1) {

    if (N == 0) {

        v.clear();

        return 0;

    }

    if (N == -1) {

        N = loadint();

        if (N==0) return 0;

    }

    int bufsize = INTSPACE*N + 3;

    if (fgets(_buf, bufsize, stdin)==NULL) return 0;

    v.resize(N);



    int i=0;

    bool last = false;

    for (char *p=&_buf[0]; ;) {

        char *q = p;

        while (*q > ' ') ++q;

        if (*q == 0x0D || *q == 0x0A) last = true;

        *q = 0;

        v[i++] = atoi(p);

        if (last || i == N) break;

        p = q+1;

    }

    return i;

}

void read_cr() {

    fgets(_buf, 256, stdin);

}





#include <vector>

using namespace std;



vector<int> primes;

vector<int> smallest_prime_factor;



int sieve(int nmax){

    primes.clear();

    smallest_prime_factor.assign(nmax+1, 0);



    for (int n=2; n<=nmax; ++n) {

        if (!smallest_prime_factor[n]) {

            primes.push_back(n);

            for (int kn=n; kn<=nmax; kn+=n) {

                if (!smallest_prime_factor[kn]) {

                    smallest_prime_factor[kn] = n;

                }

            }

        }

    }

    return primes.size();

}



vector<ii> factorize(int x) {

    vii res;

    for (int p: primes){

        if (x == 1) break;

        int cnt = 0;

        while (x % p == 0){

            x /= p;

            ++cnt;

        }

        if (cnt) res.emplace_back(p,cnt);

    }

    if (x != 1) res.emplace_back(x,1);

    return res;

}





ll solve(int N, vi& a) {

    if (N == 2) {

        return *max_element(ALL(a));

    }



    vector<map<int,int>> fs_all(N);

    map<int,vi> mp;



    rep(i,N){

        vii fs = factorize(a[i]);

        for (ii& pr: fs) {

            int p=pr.first, c=pr.second;

            mp[p].pb(c);

            fs_all[i][p] = c;

        }

    }



    for (auto &pr: mp){

        sort(ALL(pr.second));

    }



    ll best = 1;

    rep(i,N){

        ll ans = 1;

        for (auto &pr: mp){

            int p=pr.first, cnt=0;

            int L = pr.second.size();

            int ci = fs_all[i][p];

            if (ci == 0) {

                if (N-L == 1) cnt = pr.second[0];

            } else {

                if (N-L > 0) continue;

                if (L == 0) continue;

                if (pr.second[0] == ci) {

                    if (L >= 2) {

                        cnt = pr.second[1];

                    }

                } else {

                    if (L >= 1) {

                        cnt = pr.second[0];

                    }

                }

            }

            rep(i, cnt) ans *= p;

        }

        amax(best, ans);

    }

    return best;

}



int main() {

    sieve(32768);



    vi a;

    int N = loadvec(a);

    cout << solve(N,a) << endl;

    return 0;

}


// Optimized solution to the same problem (faster):
#include <bits/stdc++.h>

using namespace std;



#define NDEBUG

#include <cassert>





typedef long long ll;

typedef long double Double;

typedef unsigned long long ull;

typedef pair<int,int> ii;

typedef pair<ll,ll> llll;

typedef pair<double,double> dd;



typedef vector<int> vi;

typedef vector<vector<int>> vvi;

typedef vector<ii> vii;

typedef vector<vector<ii>> vvii;

typedef vector<ll> vll;

typedef vector<string> vs;

typedef vector<double> vd;

typedef vector<long double> vD;



#define sz(a)  int((a).size())

#define pb  push_back

#define eb  emplace_back

#define FOR(var,from,to) for(int var=(from);var<=(to);++var)

#define rep(var,n)  for(int var=0;var<(n);++var)

#define rep1(var,n)  for(int var=1;var<=(n);++var)

#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)

#define ALL(c)  (c).begin(),(c).end()

#define RALL(c)  (c).rbegin(),(c).rend()

#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)

#define found(s,e)  ((s).find(e)!=(s).end())

#define mset(arr,val)  memset(arr,val,sizeof(arr))

#define mid(x,y) ((x)+((y)-(x))/2)

#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))

#define cons make_pair



#define PQ(T) priority_queue<T>

#define RPQ(T) priority_queue<T,vector<T>,greater<T>>



template<class T> inline void amin(T & a, T const & b) { a = min(a, b); }

template<class T> inline void amax(T & a, T const & b) { a = max(a, b); }



inline ll square(ll x) { return x * x; }

inline int gcd(int a, int b) { while(a) swap(a, b%=a); return b; }





#define INTSPACE 12

char _buf[INTSPACE*1000000 + 3];



int loadint() {

    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;

    return atoi(_buf);

}



int loadvec(vector<int>& v, int N=-1) {

    if (N == 0) {

        v.clear();

        return 0;

    }

    if (N == -1) {

        N = loadint();

        if (N==0) return 0;

    }

    int bufsize = INTSPACE*N + 3;

    if (fgets(_buf, bufsize, stdin)==NULL) return 0;

    v.resize(N);



    int i=0;

    bool last = false;

    for (char *p=&_buf[0]; ;) {

        char *q = p;

        while (*q > ' ') ++q;

        if (*q == 0x0D || *q == 0x0A) last = true;

        *q = 0;

        v[i++] = atoi(p);

        if (last || i == N) break;

        p = q+1;

    }

    return i;

}

void read_cr() {

    fgets(_buf, 256, stdin);

}





int solve(int N, vi& a) {

    vi ac(N+1, 0), bc(N+1, 0);

    int best = 1;

    rep(i,N) {

        ac[i+1] = gcd(ac[i], a[i]);

    }

    rep(i,N) {

        bc[i+1] = gcd(bc[i], a[N-1-i]);

    }

    rep(i,N){

        int g = gcd(ac[i], bc[N-1-i]);

        amax(best, g);

    }

    return best;

}



int main() {

    vi a;

    int N = loadvec(a);

    cout << solve(N,a) << endl;

    return 0;

}


// Fastest known solution for this problem: