#include <bits/stdc++.h>
using namespace std;

void debug_out() {cerr << endl;}
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T)
{
    cerr << " " << H;
    debug_out(T...);
}
#ifndef ONLINE_JUDGE
    #define debug(...) cerr << "{" << #__VA_ARGS__ << "}:", debug_out(__VA_ARGS__)
#else
    #define debug(...) 42
#endif

int n;
using ll = long long;

int main(){
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    cin >> n;
    vector<ll> a(n);
    map<ll, int> mp;
    for (auto &x : a) {
        cin >> x;
    }

    for (int i = 0; i < n; i += 1) {
        mp[a[i]] = i;
    }
    
    vector<int> match(n);
    for (int i = 0; i < n; i += 2) {
        match[i] = i + 1;
        match[i + 1] = i;
    }
    if(n & 1) {
        for (int i = 0; i < n; i += 1) {
            if(a[i] == 0) {
                match.back() = match[i];
                match[match[i]] = n - 1;
                match[i] = i;
                break;
            }
        }
    }


    for (int d = 62; d >= 0; d -= 1) {
        
        function<void(int, vector<int> &) > dfs = [&](int id, vector<int> &lst) {
          //  vis[id] = vis[match[id]] = 1;
            if(!(a[id] >> d & 1)) {
                lst.emplace_back(id);
                return;
            }
            int go = mp[a[id] - (1ll << d)];
            lst.emplace_back(go);
            lst.emplace_back(id);
            dfs(match[go], lst);
        };
        for (int i = 0; i < n; i += 1) {
            if(!(a[match[i]] >> d & 1) || !(a[i] >> d & 1)) {
                continue;
            }
            vector<int> lst = {i};
            dfs(match[i], lst);

            for (int j = 0; j < lst.size(); j += 2) {
                match[lst[j]] = lst[j + 1];
                match[lst[j + 1]] = lst[j];
            }
        }
    }
    for (int i = 0; i < n; i += 1) {
        cout << a[match[i]] << "\n";
    }
    return 0;
}