#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define fi first
#define se second

int pow2(ll n){
	int cnt = 0;
    while(n%2 == 0){
		cnt++;
		n/=2;
	}
	return cnt;
}

bool solve()
{
    int n;
    if (!(cin >> n))
        return false;
	vector<ll> a(n);
	for(auto &x : a) cin >> x;
	ll cnt[35]{0}, g;
	for(int i = 0; i < n; ++i){
		int c = 0;
		while(a[i] % 2 == 0){
			a[i]/=2;
			c++;
		}
		cnt[c]++;
		if(i == 0) g = a[i];
		else g = __gcd(g,a[i]);
	}
    int p1 = 0, p2 = 0;	ll mx = 0;
	while(p1 < 35){
		if(cnt[p1] == 0) p1++;
		else {
			mx = p1; cnt[p1]--;
			while(p2 < 35 && cnt[p2] == 0) p2++;
            if(p2 == 35) {
				mx = p1;
				break;
			}
			cnt[p2]--;
			cnt[p1+1]++;
		}
	}
//	cerr << "MAX : " << mx << '\n';
	ll ans = g;
	while(mx > 0){
		mx--;
		ans *= 2;
	}
	cout << ans << '\n';
    return true;
}

int main()
{
    ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    while (solve())
        ;
}