#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

vector<pair<ll,ll>> build(vector<ll> v,int b) {
	if (v.empty()) return vector<pair<ll,ll>>(0);
	if (v.size()==1) {
		return vector<pair<ll,ll>>{mp(v[0],v[0])};
	}
	vector<ll> v0,v1;
	for (auto x:v) if (x&(1ll<<b)) v1.pb(x-(1ll<<b)); else v0.pb(x);
	auto ans0=build(v0,b-1),ans1=build(v1,b-1);
	set<ll> o(all(v1));
	for (auto &v:ans0) if (o.count(v.se)) v.se+=1ll<<b;
	for (auto &v:ans1) v.fi+=1ll<<b;
	vector<pair<ll,ll>> ans;
	int p0=0,p1=0;
	for (auto x:v) if (x&(1ll<<b)) ans.pb(ans1[p1++]);
		else ans.pb(ans0[p0++]);
	return ans;
}

int main() {
	int n;
	scanf("%d",&n);
	vector<ll> v;
	rep(i,0,n) {
		ll x;
		scanf("%lld",&x),v.pb(x);
	}
	auto ans=build(v,59);
	rep(i,0,n) printf("%lld\n",ans[i].se);
}