#include<bits/stdc++.h>
using namespace std;
#include<atcoder/all>
using namespace atcoder;
using ll = long long;
ll n;
vector<ll> a;

void solve(){
	using P = pair<ll,ll>;
	map<ll,ll> mpa;
	for(auto &i:a)mpa[i] = 0;;
	ll rbit = (1ll<<40)-1,lbit = 0;

	for(int i = 0;i<40;i++){
		
		//for(auto &[l,r]:mpa)cout<<l<<' '<<r<<endl;
		{
			rbit -= (1ll<<i);
			vector<ll> b;
			for(auto &[l,r]:mpa)b.push_back(l&rbit);
			map<ll,ll> mpb;
			for(auto &j:b){
				ll k = j+(1ll<<i);
				//cout<<"jk:"<<j<<' '<<k<<endl;
				if(mpa.count(j)+mpa.count(k)==2){
					mpb[j] = min(mpa[k],mpa[j])+(1ll<<i);
				}else if(mpa.count(j)){
					mpb[j] = mpa[j];
				}else{
					mpb[j] = mpa[k];
				}
			}
			swap(mpa,mpb);
		}
		//cout<<endl;
	}
	//for(auto &[l,r]:mpa)cout<<l<<' '<<r<<endl;cout<<endl;
	for(auto &[l,r]:mpa)cout<<r<<endl;
}

signed main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cin >> n;
	a = vector<ll>(n);
	for(auto &i:a)cin >> i;
	solve();
}