#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto& i:a)
#define ff first 
#define ss second 
#define all(a) begin(a),end(a)
#define allr(a) rbegin(a),rend(a)
#define pb push_back
using namespace std;
using ll =long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi=vector<int>;
using vll=vector<ll>;
template<class T> inline bool chmin(T& a,T b){return a>b?a=b,1:0;}
template<class T> inline bool chmax(T& a,T b){return a<b?a=b,1:0;}
pll naive(ll n){
    ll res{};pll ans;
    rep(x,0,n+1){
        rep(y,0,n+1){
            if(x+y>n)continue;
            if((x^y)!=x+y)continue;
            if(chmax(res,(ll)x*y)){
                ans={x,y};
            }
        }
    }
    return ans;
}
pll solve(ll n){
    if(n==0){
        return {0,0};
    }
    int MAXLOG=62;
    double p;
    pll a,b;
    {
        ll x{},y{};
        rrep(i,MAXLOG,0){
            if((n>>i)&1){
                x=(1ll<<i);
                break;
            }
        }
        y=n-x;
        p=x;p*=y;a={x,y};
    }
    double q;
    {
        ll x{};ll y{};
        rrep(i,MAXLOG,1){
            if((n>>i)&1){
                x=(1ll<<(i-1));
                y=((1ll<<i)-1-x);
                break;
            }
        }
        q=x;q*=y;b={x,y};
    }
    if(p>q)return a;
    else return b;
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    
    int t;
    cin>>t;
    while(t--){
        ll n;cin>>n;
        pll ans=solve(n);
        cout<<ans.ff<<' '<<ans.ss<<'\n';
    }
    /*
    rep(n,0,1000){
        pll a=solve(n);pll b=naive(n);
        if(a.ff*a.ss!=b.ff*b.ss){
            cout<<n<<endl;
            cout<<a.ff<<' '<<a.ss<<endl;
            cout<<b.ff<<' '<<b.ss<<endl;
            return 0;
        }
    }*/
    return 0;
}
/*

*/