#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <utility>
#include <string>
#include <cstring>
#include <queue>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <numeric>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, const std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, const std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, const std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, const std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;

int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  int N;
  cin >> N;
  int N_2 = 1;
  while (N_2 < N) {
    N_2 <<= 1;
  }
  const int offset = N_2 - 1;
  vector<int> gcd_tree(N_2 * 2 + 10);
  rep(i,N){
    cin >> gcd_tree[offset + i];
  }
  for (int i = offset + N; i < 2 * N_2; i++) {
    gcd_tree[i] = gcd_tree[offset + (N - 1)];
  }
  for (int j = offset - 1; j >= 0; j--) {
    gcd_tree[j] = __gcd(gcd_tree[j * 2 + 1], gcd_tree[j*2 + 2]);
  }
  int ans = gcd_tree[0];
  rep(i,N){
    std::vector<pair<int,int>> history;
    int j = offset + i;
    int a = (j % 2 == 0) ? j - 1 : j + 1;
    history.emplace_back(j, gcd_tree[j]);
    gcd_tree[j] = gcd_tree[a];
    while (j != 0) {
      j = (j - 1) / 2;
      history.emplace_back(j, gcd_tree[j]);
      gcd_tree[j] = __gcd(gcd_tree[j * 2 + 1], gcd_tree[j * 2 + 2]);
    }
    ans = std::max(ans, gcd_tree[0]);
    for (const auto& h : history) {
      gcd_tree[h.first] = h.second;
    }
  }
  cout << ans << endl;
  return 0;
}


Measured memory_bytes: 1280