#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iomanip>
using namespace std;

const int N = 1e5 + 5, inf = 1e9;
#define pb push_back
#define mp make_pair
#define ll long long
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define sz(x) (int)x.size()
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;

void solve(){
	int n;
	cin >> n;
	vi a(n);
	
    int mn = 1e9;
	for(int i = 0; i < n; i++){
		cin >> a[i];
        mn = min(mn, a[i]);
	}
    if(mn == 1){
        cout << 1 << '\n';
        return;
    }
    while(true){
        int tmp_mn = mn;
        for(int i = 0; i < n; i++){
            if(a[i] > mn){
                a[i] = (a[i]) / 2;
                if(a[i] < mn) mn = a[i];
            }
        }
        if(mn == tmp_mn){
            cout << mn << '\n';
            return;
        }
        else{
            if(tmp_mn == 2){
                cout << 1 << '\n';
                return;
            }
            cout << (tmp_mn) / 2 << '\n';
            return;
        }

    }
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int t = 1;
	// cin >> t;
	while(t--){
		solve();
	}
	return 0;
}