神秘 TLE 求调

#include<bits/stdc++.h>
using namespace std;
using ll=long long;
inline int read(){
	int x=0,f=1;
	char ch=getchar_unlocked();
	while (!isdigit(ch)){
		if (ch=='-') 
			f=-1;
		ch=getchar_unlocked();
	}
	while (isdigit(ch)){
		x=(x<<1)+(x<<3)+(ch^48);
		ch=getchar_unlocked();
	}
	return x*f;
}
inline void write(int x){
	if (x<0)putchar('-'),x=-x;
	if (x>9)write(x/10);
	putchar(x%10+'0');
}
ll log2(ll n){
    int b=1,cnt=0;
    while (b<=n)b<<=1,cnt++;
    return cnt-1;
}
ll f(ll n){
    ll k=log2(n);
    return 1LL<<k;
}
int main(){
    int T;T=read();
    while(T--){
        ll n;n=read();
        if(n==1)puts("1");
        else if (n==2)puts("3");
        else if(n==3)puts("2");
        else{
            ll m=f(n);
            if(m==n)write(n),putchar('\n');
            else write(m*2-1),putchar('\n');
        }
    }
    return 0;
}