#include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<map>
using namespace std;
int main() {
    int t;
    cin >> t;
    while (t--) {
        long long sum = 0;
        long long n, arr[40] = {0}, index = 0;
        cin >> n;
        while (n) {
            arr[index++] = n % 2;
            n /= 2;
        }
        for (int i = 31;i >= 0;i--) {
            if (arr[i] == 1) {
                sum += pow(2, 31 - i);
            }
        }
        cout << sum << endl;
    }
    return 0;
}