/**
	author:  shobonvip
	created: 2025.04.04 21:38:31
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

// 2^k とその他でわけるのが最適だと思う

// 1個下か、今のままか

void solve() {
	ll n; cin >> n;
	__int128 v1 = 0;
	ll x1 = 0;
	ll y1 = 0;
	__int128 v2 = 0;
	ll x2 = 0;
	ll y2 = 0;
	{
		ll x = 0;
		ll y = 0;
		rrep(i,0,60) {
			if (n >> i & 1) {
				if (x == 0) {
					x |= 1LL<<i;
				}else{
					y |= 1LL<<i;
				}
			}
		}
		v1 = (__int128)x * y;
		x1 = x;
		y1 = y;
	}
	{
		ll k = 0;
		while((1LL<<k)-1 <= n) {
			k++;
		}
		k--;
		ll n = (1LL<<k)-1;
		ll x = 0;
		ll y = 0;
		rrep(i,0,60) {
			if (n >> i & 1) {
				if (x == 0) {
					x |= 1LL<<i;
				}else{
					y |= 1LL<<i;
				}
			}
		}
		v2 = (__int128)x * y;
		x2 = x;
		y2 = y;
	}
	if(v1>=v2){
		cout<<x1<<' '<<y1<<'\n';
	}else{
		cout<<x2<<' '<<y2<<'\n';
	}
	
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int t; cin >> t;
	while(t--) solve();
}