#include <iostream>
#include <vector> 
#include <unordered_map>
#include <set>
#include <map>
#include <assert.h> 
using namespace std;
#define ll long long
std::pair<std::vector<long long>, std::vector<long long>>  solve(vector<ll>& arr, int x) {
    if (x < 0 || arr.size() == 0) {
        return { vector<ll>(arr.size(), 0), vector<ll>(arr.size(), 0) };
    }
    // find the values which have bit x set
    // cout << x << endl;
    // return { {}, {} };
    vector<ll> A, B;
    map<ll, ll> posB;
    for (int i = 0; i < arr.size(); i++) {
        if (arr[i] & (1ll << x)) {
            A.push_back(arr[i] ^ (1ll << x));
        }
        else {
            B.push_back(arr[i]);
            posB[arr[i] & ((1ll << x) - 1)] = i;
        }
    }
    // return { {}, {} };
    // set<int> all;
    auto [A1, A2] = solve(A, x - 1);
    auto [B1, B2] = solve(B, x - 1);
    set<ll> all;
    for (ll t : A1) {
        // all[t & ((1 << x) - 1)] = 0;
        all.insert(t);
    }

    // for (auto& t : A1) {
    //     t ^= (1 << x);
    // }
    for (long long& t : B1) {
        if (all.count(t)) {
            // assert(1 << x == 1ll << x);
            t ^= (1ll << x);
        }
    }
    // now for every B1 
    auto& res1 = A1;
    auto& res2 = A2;
    for (ll& t : res2)
        t ^= (1 << x);

    for (int i = 0; i < B1.size(); i++) {
        res1.push_back(B1[i]);
        res2.push_back(B2[i]);
    }

    return { res1, res2 };
}

main() {
    int n;
    cin >> n;

    vector<ll> arr;
    unordered_map<ll, ll> mp;
    for (int i = 0; i < n; i++) {
        ll x; cin >> x;
        arr.push_back(x);
        mp[x] = i;

        // sort(arr.bsegin(), arr.end());
    }
    auto [A, B] = solve(arr, 59);
    // return 0;
    vector<ll> E(n);
    // cout << A.size() << ' ' << B.size() << ' ';
    for (int i = 0; i < arr.size(); i++) {

        E[mp[A[i]]] = B[i];
        // cout << mp[arr[i]];
    }
    for (int i = 0; i < n; i++) {
        cout << E[mp[arr[i]]] << '\n';
    }
}