#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double db;

#define TESTCASE 0

static void solve([[maybe_unused]] int tc) {
    int n;
    cin >> n;
    vector<long long> a(n);
    
    for (int i = 0; i < n; i++)cin >> a[i];
    
    /*
    set<int> ds;
    vector<long long> a;
    
    for(int i=0;i<3;i++){
        int x=rand()%128;
        for(int j=0;j<128;j++)if((x&j)==j)ds.insert(j);
    }
    for(auto i : ds)a.push_back(i);
    int n=a.size();
    
    cout<<n<<"\n";
    for(auto i : a)cout<<i<<" ";
    cout<<"\n";
    */
    if (n == 1) {
        cout << "0\n";
        return;
    }
    
    auto solve = [&](auto &solve, int pos, vector<long long> v) -> map<long long, long long> {
        if (v.size() == 0) {
            return map<long long, long long>();
        }
        if (v.size() == 2) {
            return map<long long, long long>{{v[0], v[1]},
                {v[1], v[0]}};
        }
        if (v.size() == 1) {
            return map<long long, long long>{{v[0], v[0]}};
        }
        
        //cout<<pos<<" bit\n";
        //for(auto i : v)cout<<i<<" ";
        //cout<<"\n";
        
        map<long long, long long> res;
        
        vector<long long> v0, v1;
        for (auto i: v) {
            if (i & (1ll << pos))v1.push_back(i);
            else v0.push_back(i);
        }
        
        map<long long, long long> sol0, sol1;
        sol0 = solve(solve, pos - 1, v0);
        sol1 = solve(solve, pos - 1, v1);
        
        //cout<<pos<<" bit ritorno\n";
        //for(auto i : v)cout<<i<<" ";
        //cout<<"\n";
        
        
        //cout<<"sol0 \n";
        //for(auto [i,j] : sol0)cout<<i<<" "<<j<<"\n";
        //cout<<"sol1 \n";
        //for(auto [i,j] : sol1)cout<<i<<" "<<j<<"\n";
        
        map<long long, int> col;
        auto dfs = [&](auto &dfs, long long nodo, int mode) -> void {
            
            if (col.find(nodo) != col.end())return;
            
            //cout << pos << " "<<mode<<" dfs\n";
            col[nodo] = mode;
            
            dfs(dfs, sol1[nodo], mode ^ 1);
            
            //cout<<"da "<<pos<<"check "<<(pos ^ (1ll << pos))<<"\n";
            if (sol0.find(nodo ^ (1ll << pos)) != sol0.end())
                if (sol1.find(sol0[nodo ^ (1ll << pos)] ^ (1ll << pos)) != sol1.end()) {
                dfs(dfs, sol0[nodo ^ (1ll << pos)] ^ (1ll << pos), mode ^ 1);
            }
        };
        
        int loop0 = -1, loop1 = -1;
        int cont0=0;
        int cont1=0;
        
        for (auto [i, j]: sol0) {
            if (i == j)loop0 = i,cont0++;
        }
        for (auto [i, j]: sol1) {
            if (i == j)loop1 = i,cont1++;
        }
        assert(cont0<=1 && cont1<=1);
        
        
        if(loop1!=-1 && loop0==-1)dfs(dfs,loop1,1);
        if(loop0!=-1 && loop1==-1 && sol1.find(loop0^(1ll<<pos))!=sol1.end())dfs(dfs,loop0^(1ll<<pos),0);
        for (auto i: v1)if (sol1[i] != i)dfs(dfs, i, 1);
        
        
        if (loop0 != -1 && loop1 != -1) {
            //assert((loop0^(1<<pos))==loop1);
            //assert(col[loop1]==0);
            sol0[loop0] = loop1;
            sol1[loop1] = loop0;
            loop0 = -1;
            loop1 = -1;
        }
        
        for (auto [i, j]: sol1) {
            if (col[i] == 1) {
                if(i==j){
                    int a=i^(1ll<<pos);
                    int b=sol0[a];
                    
                    sol1[i]=b;
                    sol0[b]=i;
                    sol0[a]=a;
                    continue;
                }
                int a = i ^ (1ll << pos);
                int b = sol0[a];
                //assert(a!=b);
                
                sol1[i] = b;
                sol1[j] = a;
                sol0[a] = j;
                sol0[b] = i;
            }
        }
        
        
        for (auto [i, j]: sol0)res[i] = j;
        for (auto [i, j]: sol1)res[i] = j;
        
        int cont=0;
        for(auto [i,j] : res){
            if(i==j)cont++;
            //cout<<i<<" -> "<<j<<"\n";
            //assert(((i&((1ll<<(pos+1))-1))&(j&((1ll<<(pos+1))-1)))==0);
            
        }
        assert(cont<=1);
        
        return res;
    };    
    auto sol = solve(solve, 59, a);
    
    for (int i = 0; i < n; i++) {
        cout << sol[a[i]] << "\n";
        //assert((a[i]&sol[a[i]])==0);
    }
}

int main() {
    //ios::sync_with_stdio(false);
    
    if (const char *f = getenv("REDIRECT_STDOUT"); f) {
        freopen(f, "w", stdout);
    }
    
    srand(42);
    int T = 1;
#if TESTCASE
    cin >> T;
#endif
    
    for (int t = 1; t <= T; t++) {
        solve(t);
    }
    
    return 0;
}