#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
const int N=1e5+10;
int gcd(int a,int b){return !b?a:gcd(b,a%b);}
int n,a[N];
int pre[N],suf[N];
int main(){
	scanf("%d",&n);for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	pre[1]=a[1];for(int i=2;i<=n;i++)pre[i]=gcd(pre[i-1],a[i]);
	suf[n]=a[n];for(int i=n-1;i;i--)suf[i]=gcd(suf[i+1],a[i]);
	int ans=max(pre[n-1],suf[2]);
	for(int i=2;i<=n-1;i++)ans=max(ans,gcd(pre[i-1],suf[i+1]));
	cout<<ans;
}