#include<stdio.h>
#include<math.h>
#include<vector>
#include<algorithm>
#define ll long long
using namespace std;
int main(){
	ll N;
	scanf("%lld",&N);
	vector<ll> a(N);
	for(ll i = 0; i < N; i++) scanf("%lld",&a.at(i));
	sort(a.begin(),a.end());
	for(ll i = 0; i < N - 1; i++){
		if(a.at(i) == a.at(i + 1)){
			a.erase(a.begin() + i);
			N--;
			i--;
		}
	}
	ll b = a.at(0);
	if(N == 1) printf("%lld\n",a.at(0));
	else {
		ll c = a.at(1);
		vector<pair<ll,bool>> lcd;
		pair<ll,bool>p;
		for(ll i = 1; i < sqrt(a.at(0)); i++){
			if(b % i == 0){
				if(c % i == 0){
					p.first = i;
					p.second = true;
					lcd.push_back(p);
				}
				if(c % (b / i) == 0){
					p.first = b / i;	
					p.second = true;
					lcd.push_back(p);
				}
			}
		}
		sort(lcd.begin(),lcd.end());
		for(ll i = 0; i < lcd.size(); i++){
			for(ll j = 0; j < N; j++){
				if(a.at(j) % lcd.at(i).first){
					lcd.at(i).second = false;
				       	break;
				}
			}
		}
		for(ll i = lcd.size() - 1; i > -1; i--){
			if(lcd.at(i).second) {
				printf("%lld\n",lcd.at(i).first);
				break;
			}
		}
	}	
	return 0;
}

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr<<#a<<"="<<a<<endl
#define dumparr(a,n) cerr<<#a<<"["<<n<<"]="<<a[n]<<endl
#else
#define dump(a) 
#define dumparr(a,n) 
#endif
#define FOR(i, a, b) for(ll i = (ll)a;i < (ll)b;i++)
#define For(i, a) FOR(i, 0, a)
#define REV(i, a, b) for(ll i = (ll)b-1LL;i >= (ll)a;i--)
#define Rev(i, a) REV(i, 0, a)
#define REP(a) For(i, a)
#define SIGN(a) (a==0?0:(a>0?1:-1))

typedef long long int ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<ll, ll> pll;
typedef pair<ll,pll> ppll;
typedef vector<ll> vll;
typedef long double ld;
typedef pair<ld,ld> pdd;

pll operator+(pll a,pll b){
  return pll(a.first+b.first,a.second+b.second);
}
pll operator-(pll a,pll b){
  return pll(a.first-b.first,a.second-b.second);
}
pll operator*(ll a,pll b){
  return pll(b.first*a,b.second*a);
}
const ll INF=(1LL<<60);
#if __cplusplus<201700L
ll gcd(ll a, ll b) {
  a=abs(a);
  b=abs(b);
  if(a==0)return b;
  if(b==0)return a;
  if(a < b) return gcd(b, a);
  ll r;
  while ((r=a%b)) {
    a = b;
    b = r;
  }
  return b;
}
#endif
template<class T>
bool chmax(T& a,const T& b){
  if(a<b){
    a=b;
    return true;
  }
  return false;
}
template<class T>
bool chmin(T& a,const T& b){
  if(a>b){
    a=b;
    return true;
  }
  return false;
}
template<class S,class T>
std::ostream& operator<<(std::ostream& os,pair<S,T> a){
  os << "(" << a.first << "," << a.second << ")";
  return os;
}
template<class T>
std::ostream& operator<<(std::ostream& os,vector<T> a){
  os << "[ ";
  REP(a.size()){
    os<< a[i] << " ";
  }
  os<< " ]";
  return os;
}


void solve(long long N, std::vector<long long> a){
  ll ans=a[0];
  REP(N){
    ans=gcd(ans,a[i]);
  }
  cout<<ans<<endl;
}

int main(){
  cout<<setprecision(1000);
    long long N;
    scanf("%lld",&N);
    std::vector<long long> a(N);
    for(int i = 0 ; i < N ; i++){
        scanf("%lld",&a[i]);
    }
    solve(N, std::move(a));
    return 0;
}
