import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

/*
 * not solve the this problem at july thirty-One
 */
public class Main {
    public static abstract class BitNum {
        public abstract String getBitnum();
    };
    public static class Blefuscu extends BitNum implements Comparable<Blefuscu> {
        private String bitnum;
        private int bitCount;
        Blefuscu(String bitString) {
            this.bitnum = bitString;
        }
        @Override
        public String toString() {
            return "BitNum [bitnum=" + bitnum + ", bitCount=" + bitCount + "]";
        }
        @Override
        public int compareTo(Blefuscu o) {
            // TODO Auto-generated method stub
            return Integer.valueOf(o.bitnum, 2)
                    - Integer.valueOf(this.bitnum, 2);
        }
        @Override
        public String getBitnum() {
            // TODO Auto-generated method stub
            return this.bitnum;
        }
    }
    public static class Lilliput extends BitNum implements Comparable<Lilliput> {
        private String bitnum;
        private int bitCount;
        Lilliput(String bitString) {
            this.bitnum = bitString;
        }
        @Override
        public String toString() {
            return "Lilliput [bitnum=" + bitnum + ", bitCount=" + bitCount
                    + "]";
        }
        @Override
        public int compareTo(Lilliput o) {
            // TODO Auto-generated method stub
            return Integer.valueOf(this.bitnum, 2)
                    - Integer.valueOf(o.bitnum, 2);
        }
        @Override
        public String getBitnum() {
            // TODO Auto-generated method stub
            return this.bitnum;
        }
    }
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int cases = Integer.valueOf(sc.nextLine());

        while (cases-- > 0) {
            long num = Long.valueOf(sc.nextLine());

            String bitString = Long.toBinaryString(num);
            int i = 0;
            bitString = matchlength(bitString);

            List<Blefuscu> Blelist = new ArrayList<Blefuscu>();
            List<Lilliput> Lillist = new ArrayList<Lilliput>();
            while (i < 4) {
                Blelist.add(new Blefuscu(bitString
                        .substring(i * 8, (i + 1) * 8)));
                Lillist.add(new Lilliput(bitString
                        .substring(i * 8, (i + 1) * 8)));
                i++;
            }
            Collections.sort(Blelist);
            Collections.sort(Lillist);

            long br = getNum(Blelist);
            long lr = getNum(Lillist);
            if (br == num) {
                System.out.println(lr);
            } else {
                System.out.println(br);
            }
        }
    }
    public static <T extends BitNum> long getNum(List<T> list) {
        StringBuffer sb = new StringBuffer();
        for (T bn : list) {
            sb.append(bn.getBitnum());
        }
        return Long.valueOf(sb.toString(), 2);
    }
    public static String matchlength(String bitNumString) {
        while (bitNumString.length() != 32) {
            bitNumString = "0" + bitNumString;
        }
        return bitNumString;
    }
}