#pragma ide diagnostic ignored "misc-no-recursion"

#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];

    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;
        int loop = -1;
        if (v.size() % 2 == 1) {
            for (int i = 0; i < (int) v.size(); i++) {
                if ((v[i] & ((1ll << pos) - 1)) == 0) {
                    res[v[i]] = v[i];
                    loop = v[i];
                    v.erase(v.begin() + i);

                    break;
                }
            }
        }
        //for (auto i: v)cout << i << " ";
        //cout << "\n";

        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);

        map<long long, int> col;
        auto dfs = [&](auto &dfs, long long pos, int mode) -> void {
            //cout << pos << " dfs\n";
            if (col.find(pos) != col.end())return;
            col[pos] = mode;

            dfs(dfs, sol1[pos], mode ^ 1);

            if (sol0.find(pos ^ (1ll << pos)) != sol0.end())
                if (sol1.find(sol0[pos ^ (1ll << pos)] ^ (1ll << pos)) != sol1.end()) {
                    dfs(dfs, sol0[pos ^ (1ll << pos)] ^ (1ll << pos), mode ^ 1);
                }
        };


        for (auto i: v1)if (sol1[i] != i)dfs(dfs, i, 0);

        int loop0 = -1, loop1 = -1;

        for (auto [i, j]: sol0) {
            if (i == j)loop0 = i;
        }
        for (auto [i, j]: sol1) {
            if (i == j)loop1 = i;
        }

        if (loop0 != -1 && loop1 != -1) {
            sol0[loop0] = loop1;
            sol1[loop1] = loop0;
        }

        if (loop != -1 && loop1 != -1) {
            res[loop] = loop1;
            sol1[loop1] = loop;
        }

        if (loop0 != -1 && loop != -1) {
            sol0[loop0] = loop;
            res[loop] = loop0;
        }

        for (auto [i, j]: sol1) {
            if (col[i] == 1) {
                int a = i ^ (1ll << pos);
                int b = sol0[a];
                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;
        return res;
    };

    auto sol = solve(solve, 59, a);

    for (int i = 0; i < n; i++) {
        cout << sol[a[i]] << "\n";
    }
}

int main() {
    ios::sync_with_stdio(false);

    if (const char *f = getenv("REDIRECT_STDOUT"); f) {
        freopen(f, "w", stdout);
    }

    int T = 1;
#if TESTCASE
    cin >> T;
#endif

    for (int t = 1; t <= T; t++) {
        solve(t);
    }

    return 0;
}