#include<bits/stdc++.h>
using namespace std;

#define ing long long 
#define F first 
#define S second 
#define pb push_back 

int d(int t1){
    int c1=0,c2=0;
    while(t1%2==0) t1/=2,c1++;
    return c1;
}

void solve(){
    int n;
    cin>>n;
    vector<int>a(n+1);
    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<>>now;
    for(int i=1;i<=n;i++) cin>>a[i],now.push({d(a[i]),a[i]});


    while(now.size()>1){
        auto t1=now.top();now.pop();
        auto t2=now.top();now.pop();
        int v=__gcd(t1.S,t2.S)*2;
        int dd=d(v);
        now.push({dd,v});
    }
    cout<<now.top().S<<"\n";
}

signed main(){
    ios::sync_with_stdio(0);cin.tie(0);
    solve();
    return 0;
}