HRK : Flip

import java.util.ArrayList;
import java.util.Scanner;

public class Solutions {

public static void main(String[] args) {
// TODO Auto-generated method stub

final int END = 31;
long[] arr = new long[END+1];
long[] arrlist = new long[100];
int count = 0;
long number = 0;
long complement_number;
int j,k,p;
long remainder;

Scanner in = new Scanner(System.in);


count = in.nextInt();
if((count>=1 && count<=100))
{

for (int n = 0  ;n <count ;n++ )
{
arrlist[n] = in.nextLong();
}

for (int m = 0  ;m <count ;m++ )
{

for( k =0;k<=END;k++)
{ arr[k] = 0;}

number = arrlist[m];
j = END;
complement_number = 0;
remainder = 0;

while(number>0)
{
remainder =number%2;
arr[j] = remainder;
j--;
number = number/2;

}
// System.out.println("");
for ( k =0 ;k<=END;k++)
{
if(((arr[k])*1) == 1)
arr[k] = 0;
else
{
arr[k] = 1;
}
}


for ( k = END,p=0 ;k>=0;k--,p++)
{

complement_number = (long)(complement_number + (long)arr[k]*Math.pow(2, p));

}

System.out.println(""+(long)complement_number);

}

}

}


}