#include<bits/stdc++.h>
#define rep(i,n) for(int i=1;i<=n;++i)
#define pb push_back
using namespace std;
typedef long long ll;
typedef vector<int> vi;
const int N=(1<<18)+5;
ll a[N],s[N],to[N];
int n;
void sol(int l,int r,int tp){
    if(tp==-1){
        to[l]=s[l];
        return;
    }
    int mid=l;
    while(mid<=r&&(s[mid]&(1ll<<tp))==0)++mid;
    sol(l,mid-1,tp-1);
    if(mid<=r){
        sol(mid,r,tp-1);
        int ptr=l;
        for(int i=mid;i<=r;++i){
            while(s[ptr]+(1ll<<tp)!=s[i])++ptr;
            swap(to[ptr],to[i]);
        }
    }
}
int main(){
    scanf("%d",&n);
    rep(i,n)scanf("%d",a+i),s[i]=a[i];
    sort(s+1,s+n+1);
    sol(1,n,59);
    rep(i,n){
        int pos=lower_bound(s+1,s+n+1,a[i])-s;
        printf("%lld\n",to[pos]);
        //if((a[i]&to[pos])!=0)puts("FUCK");
    }
}
/*
3 3 3
1 1
1 2
1 3
 */