#include<iostream>
#include<queue>
#include<algorithm>
#define lowbit(k) ((-k)&k)
using namespace std;
long long n,a[100005],g;
priority_queue<long long>q;
int main(){
    cin>>n;
    for(long long i=1;i<=n;++i){
        cin>>a[i];
        long long low=lowbit(a[i]);
        a[i]/=low;
        if(g==0)g=a[i];
        else g=__gcd(g,a[i]);
        long long x=0;
        while(low>1){
            x++;
            low>>=1;
        }
        q.push(-x);
    }
    while(1){
        if(q.size()<=1)break;
        long long x=q.top();q.pop();
        long long y=q.top();q.pop();
        if(x==y)q.push(x-1);
        else q.push(max(x,y)-1);
    }
    long long x=-q.top();
    cout<<(1<<x)*g<<endl;
    return 0;
}