#include <iostream>

using namespace std;

long long n,x;

long long mbit(long long x){
	 
	 long long mem = x, rs = 0;
	 int a[40], i = 0, n = 0;
	 while(x){
  	 		  a[n] = x%2;
  	 		  x /= 2;
  	 		  n++;
	 }
	 
	 int pz = -1, pz1 = -1;
	 for(int i = 0; i < n; i++)
	 {
	  if(pz == -1 && a[i]) pz = i;
	  if(pz != -1 && a[i] == 0) pz1 = i;
	 }
	 
	 if(pz1 == -1) return mem;
	 
	 swap(a[pz],a[pz1]);
	 int put = 1;
	 for(int i = 0; i < n; i++) rs += a[i]*put, put *= 2;
	 return rs;
}

int main(){

	cin >> n;
	while(n--){
			   cin >> x;
			   cout << mbit(x) << ' ';
	}
	return (0);
}