#include <iostream>
#include <vector>
using namespace std;

bool hasConsecutiveOnes(int num) {
    return (num & (num >> 1)) != 0;
}

int solve(int p) {
    if (!hasConsecutiveOnes(p)) {
        return p;
    }

    int mask = 1;

    for (int i = 30; i >= 0; --i) {
        int bit_i = (p >> i) & 1;
        int bit_i_next = (p >> (i + 1)) & 1;

        if (bit_i == 1 && bit_i_next == 1) {
            mask = (1 << (i + 1)) - 1;
            p = (p & ~mask) + (1 << (i + 1));
            break;
        }
    }

    return solve(p);
}

int main() {
     int t; 
    cin >> t;
      while (t--) {
    int p;
    cin >> p;
    
    cout << solve(p) << endl;
      }
    return 0;
}

#include <bits/stdc++.h> 
using namespace std; 
#define ll long long 
map<string, map<string, ll>> user; 
map<string, ll> users; 
set<string> banks; 
vector<string> split(const string &s) { 
    stringstream ss(s); 
    vector<string> result; 
    string token; 

    while (getline(ss, token, ',')) { 
        result.push_back(token); 
    } 
    return result; 
}
void init(string &s) { 
    vector<string> bankers = split(s); 
    ll balance = stoll(bankers[2]); 
    users[bankers[1]] = balance; 
    for (int i = 3; i < bankers.size(); i++) { 
        user[bankers[1]].insert({bankers[i], balance}); 
        banks.insert(bankers[i]); 
    } 
}
string post(string &s) { 
    vector<string> help = split(s); 
    ll value = stoll(help[4]); 
    
    if (banks.find(help[2]) != banks.end() && banks.find(help[3]) != banks.end()) 
        return "FAILURE"; 
    
    if (banks.find(help[3]) != banks.end()) { 
        if (users.find(help[2]) == users.end()) return "FAILURE"; 
        if (user[help[2]].find(help[3]) == user[help[2]].end()) return "FAILURE"; 
        if (users[help[2]] < value) return "FAILURE"; 
        users[help[2]] -= value; 
        return "SUCCESS"; 
    } 
    
    if (banks.find(help[2]) != banks.end()) { 
        if (users.find(help[3]) == users.end()) return "FAILURE"; 
        if (user[help[3]].find(help[2]) == user[help[3]].end()) return "FAILURE"; 
        users[help[3]] += value; 
        return "SUCCESS"; 
    } 
    
    if (users.find(help[2]) == users.end() || users.find(help[3]) == users.end()) return "FAILURE"; 
    if (users[help[2]] < value) return "FAILURE"; 
    users[help[2]] -= value; 
    users[help[3]] += value; 
    return "SUCCESS"; 
}

string get(string &s) { 
    vector<string> help = split(s); 
    if (users.find(help[2]) == users.end()) return "FAILURE"; 
    return to_string(users[help[2]]); 
}
static bool comp(const string &x, const string &y) { 
    vector<string> a = split(x); 
    vector<string> b = split(y); 
    return stoll(a[1]) < stoll(b[1]); 
}

string get_command_results(vector<string> commands) { 
    vector<string> check; 
        for (auto &it : commands) { 
        if (it[0] == 'I') { 
            init(it); 
        } else { 
            check.push_back(it); 
        } 
    } 
    
    sort(check.begin(), check.end(), comp); 
    map<string, string> res; 
        for (auto &it : check) { 
        if (it[0] == 'P') { 
            res[it] = post(it); 
        } 
        if (it[0] == 'G') { 
            res[it] = get(it); 
        } 
    } 
    
    string ans; 
    for (auto &it : commands) { 
        if (res.find(it) != res.end()) {
            if (!ans.empty()) ans += ",";
            ans += res[it];
        } 
    } 
    
    return ans;  
}

#include <iostream>
#include <vector>
#include <string>
using namespace std;
bool s(const string& s1, const string& s2) {
    if (s1.size() != s2.size()) return false;
    int diffCount = 0;
    for (int i = 0; i < s1.size(); ++i) {
    if (s1[i] != s2[i]) {
        diffCount++;
        }
    if (diffCount > 1) return false; 
    }
    return (diffCount == 1);
}
vector<string> solve(const vector<string>& start, const vector<string>& fin) {
    vector<string> result(fin.size(), "NO");
    for (int i = 0; i < fin.size(); ++i) {
    for (const string& startStr : start) {
    if (s(startStr, fin[i])) {
    result[i] = "YES";
    break;
            }
        }
    }

    return result;
}
int main() {
    int n, m;
    cin >> n;
    vector<string> start(n);
    for (int i = 0; i < n; ++i) {
        cin >> start[i];
    }
    cin >> m;
    vector<string> fin(m);
    for (int i = 0; i < m; ++i) {
        cin >> fin[i];
    }
    vector<string> result = solve(start, fin);
    for (const string& res : result) {
        cout << res << endl;
    }
    return 0;
}

#include <iostream>
#define ll long long
#include <vector>
using namespace std;
ll minSelectionsInWorstCase(vector<int>& choices) {
    ll n = choices.size();
    vector<int> s(n, 0); 
    ll t = 0;  
    s[n - 1] = choices[n - 1]; 
    for (int i = n - 2; i >= 0; --i) {
        s[i] = choices[i] + s[i + 1]; 
    }
    
    t = s[0]; 
    return t;
}