#include<iostream>
using namespace std;
using ll = long long;

int main(){
    int T;
    cin >> T;
    for(int testcase = 0; testcase < T; testcase++){
        ll N;
        cin >> N;
        if(N == 0){//N=0のとき、1となっているビットが無いため、場合分けして処理
            cout << 0 << " " << 0 << endl;
            continue;
        }
        for(ll j = 61;j >= 0;j--){
            if(N & (1LL << j)){
                ll A = N - (1LL << j);
                ll B = (1LL << (j-1)) - 1;
                if(A * 2 >= B){//方法1が最善なら
                    cout << (1LL << j) << " " << A << endl;
                }
                else{//方法2が最善なら
                    cout << (1LL << (j-1)) << " " << (1LL << (j-1)) - 1 << endl;
                }
                break;
            }
        }
    }
    return 0;
}