#include <iostream>
#include <fstream>
using namespace std;
int n,i,s[100000000],a[100000000];
void aranjare(int *v, int n,int mod){
    int s=0,p=0;
    for(i=1;i<=n;i++){
        if((v[i]&mod)==0)s++;
    }
    for(i=1;i<=n;i++){
        if((v[i]&mod)==0)a[++p]=v[i];
        else a[++s]=v[i];
    }
    for(i=1;i<=n;i++)v[i]=a[i];

}
int main(){
    ifstream in("algsort.in");
    ofstream out("algsort.out");
    in>>n;
    for(i=1;i<=n;i++)
        in>>s[i];
    for(int step=0;step<=30;step++){
        aranjare(s,n,(1<<step));
    }

    for(i=1;i<=n;i++)
        out<<s[i]<<" ";
}