#include <bits/stdc++.h>
#define int long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<double, double>
#define F first
#define S second
#define all(x) x.begin(), x.end()
using namespace std;
int n, arr[300015];
set<int> s[65];
map<int, int> ans;
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++){
        cin >> arr[i];
        if (n % 2 == 1 && arr[i] == 0)
            continue;
        for (int j = 0; j < 60; j++){
            if (arr[i] & (1LL << j))
                s[j].insert(arr[i]);
        }
    }
    int zero = 0;
    for (int _ = 0; _ < n / 2; _++){
        vector<int> ori;
        for (int j = 0; j < 60; j++)
            if (!s[j].empty())
                ori.emplace_back(*(--s[j].end()));
        int mx = 0, val = 0, test = 0, res = 0;
        for (auto i : ori){
            if (__builtin_popcountll(i) > mx)
                mx = __builtin_popcountll(i), val = i;
        }
        test = ((1LL << 60) - 1) - val;
        mx = 0;
        for (int i : ori){
            int tmp = (test & i);
            if (__builtin_popcountll(tmp) > mx)
                mx = __builtin_popcountll(tmp), res = tmp;
        }
        ans[val] = res;
        ans[res] = val;
        zero += (res == 0);
        for (int j = 0; j < 60; j++){
            if (val & (1LL << j))
                s[j].erase(val);
            if (res & (1LL << j))
                s[j].erase(res);
        }
    }
    assert(zero <= 1);
    for (int i = 1; i <= n; i++)
        cout << ans[arr[i]] << "\n";
}