#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

vector<pll> f(vector<ll> A, vector<ll> B, int k)
{
    assert(A.size() == B.size());
    if(A.size() == 0) return vector<pll>();
    if(A.size() == 1) return vector<pll>{{A[0], B[0]}};

    vector<pll> V, W;
    vector<ll> C, D, E, F;
    for(auto i : A)
    {
        if(i >> k & 1) V.push_back({ (i >> (k + 1)), i });
        else C.push_back(i);
    }
    for(auto i : B)
    {
        if(i >> k & 1) W.push_back({ (i >> (k + 1)), i });
        else D.push_back(i);
    }
    V.push_back({1ll << 61, 0});
    W.push_back({1ll << 61, 0});
    sort(V.begin(), V.end());
    sort(W.begin(), W.end());

    auto X = f(C, D, k + 1);
    vector<pll> ret;
    for(auto [x, y] : X)
    {
        auto [i, _x] = *lower_bound(V.begin(), V.end(), pll{x >> (k + 1), -1});
        auto [j, _y] = *lower_bound(W.begin(), W.end(), pll{y >> (k + 1), -1});
        bool f1 = (i == (x >> (k + 1)));
        bool f2 = (j == (y >> (k + 1)));
        if(!f1 && !f2) ret.push_back({x, y});
        else if(!f1 && f2)
        {
            ret.push_back({x, _y});
            F.push_back(y);
        }
        else if(f1 && !f2)
        {
            ret.push_back({_x, y});
            E.push_back(x);
        }
        else
        {
            ret.push_back({x, _y});
            E.push_back(_x);
            F.push_back(y);
        }
    }

    auto Y = f(E, F, k + 1);
    for(auto [x, y] : Y) ret.push_back({x, y});

    return ret;
}

int main() {
    cin.tie(0); ios_base::sync_with_stdio(0);

    int n; cin >> n;
    vector<ll> A(n); for(auto &i : A) cin >> i;
    auto B = f(A, A, 0);
    sort(B.begin(), B.end());
    for(auto i : A) cout << lower_bound(B.begin(), B.end(), pll{i, -1})->ss << '\n';
}