#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001LL
void out(long long x,long long y){
	cout<<x<<' '<<y<<endl;
}
void solve(long long n){
	if(n==0){
		out(0,0);
		return;
	}
	if(n==1){
		out(0,1);
		return;
	}
	int ma = 0;
	rep(i,60){
		if((n>>i)&1)ma = i;
	}
	long long ax = 1LL << (ma-1);
	long long ay = ax - 1;
	long long bx = 1LL << ma;
	long long by = n - bx;
	
	__int128 X = ax;
	X *= ay;
	__int128 Y = bx;
	Y *= by;
	if(X >= Y)out(ax,ay);
	else out(bx,by);
}

int main() {
	
	int _t;
	cin>>_t;
	rep(_,_t){
		long long n;
		cin>>n;
		solve(n);
		
	}
}