#include <cstring>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <iostream>
#include <unordered_map>
#include <unordered_set>


using namespace std;

#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define fi first
#define se second

typedef long long ll;
typedef pair<int,int> PII;
typedef unsigned long long ull;
typedef double de;
typedef pair<ll,ll> pll;
const int N = 1e6+10;

unordered_map<ll,int> st;
ll a[N];
int p[N];
int main()
{
    int n;
    cin >> n;
    rep(i,1,n)
    {
        scanf("%lld",&a[i]);
        p[i]=i;
        st[a[i]]=i;
    }
    rep(i,0,60)
    {
        rep(j,1,n)
        {
            if(a[j]>>i&1)
            swap(p[j],p[st[a[j]^(1<<i)]]);
        }
    }
    rep(i,1,n) printf("%lld\n",a[p[i]]);
    return 0;
}