#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		long long n; cin >> n;
		if (n <= 2) {
			cout << 0 << " " << n << endl;
			continue;
		}
		long long a = -1, b = -1, c = -1, d = -1;
		rrep(i, 61) {
			if (1 & (n >> i)) {
				a = i;
				b = n - (1LL << a);

				c = i - 1;
				d = (1LL << i) - 1 - (1LL << c);
				break;
			}
		}
		if (b * 2 >= d) {
			cout << (1LL << a) << " " << b << endl;
		}
		else {
			cout << (1LL << c) << " " << d << endl;
		}
	}
	return 0;
}