#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pli;
const int N = 2000086, MOD = 1e9 + 7, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N];

int a[20][20];

int main() {
    int T;
    cin >> T;
    while (T--) {
        cin >> n;
        int c = 0;
        for (int j = 0; j <= 30; j++) {
            if (n >> j & 1) c++;
            else {
                if (c > 1) {
                    ll t = 1 << j;
                    for (int i = j + 1; i <= 30; i++) t += n >> i << i;
                    printf("%lld\n", t - n);
                    break;
                }
            }
        }
    }
    return 0;
}