# include <cstdio>
# include <algorithm>
using namespace std;

int n;

int bit(int x){

    long long maxim = x;
    int right_most = 0;
    int left_most = 0;

    for (int i=1; i<=x; i<<=1){
        if (x & i){
            right_most = i;
            break;
            }
    }

    for (maxim = 1; maxim <= x; maxim <<= 1);

    maxim /= 2;

    for (; maxim >= 1; maxim >>=1){
        if (!(maxim & x)){
            left_most = maxim;
            break;
        }
    }

    if (left_most < right_most)
        return x;

    return x + left_most - right_most;
}

void read(){
    scanf("%d", &n);
    for (int i=1; i<=n; i++){
        int x;
        scanf("%d", &x);

        printf("%d ", bit(x));
    }
}

int main(){
    read();
    //bit(9);
    return 0;
}