#include<bits/stdc++.h> using namespace std; const int N=1.2e6+10,LM=1.1e6,U=(1<<20)-1,SZ=20; int n,a[N],bel[N],Ans[N],tot=0;bool vis[N]; vector<int> vec[N],buc[N]; queue<int> q,tmp; void bfs(int x,int clr){ q.push(x); while(!q.empty()){ int p=q.front();q.pop(); int S=U^p;tmp.push(S); while(!tmp.empty()){ int tp=tmp.front();tmp.pop(); if(vis[tp]) continue;vis[tp]=1; for(auto ed:vec[tp]) bel[ed]=clr; if(vec[tp].size()) q.push(tp); for(int i=0;i<SZ;i++)if((tp>>i)&1)tmp.push(tp^(1<<i)); } } } int main(){ //freopen("seq.in","r",stdin); //freopen("seq.out","w",stdout); ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin>>n; for(int i=1;i<=n;i++) cin>>a[i]; for(int i=n;i>=1;i--) vec[a[i]].push_back(i); for(int i=1;i<=n;i++){ if(!bel[i]){ vec[a[i]].pop_back(); bel[i]=++tot;bfs(a[i],bel[i]); } } for(int i=1;i<=n;i++) buc[bel[i]].push_back(a[i]); for(int i=0;i<=U;i++) sort(buc[i].begin(),buc[i].end()); for(int i=n;i>=1;i--){ Ans[i]=buc[bel[i]].back(); buc[bel[i]].pop_back(); } for(int i=1;i<=n;i++) cout<<Ans[i]<<' ';cout<<endl; return 0; }