#include<stdio.h>
void solve()
{
	long long int n;
	scanf("%lld", &n);
	long long int b, x[2], y[2];
	for (b = 1; b <= n; b *= 2);
	b /= 2;
	x[0] = b;
	y[0] = (n ^ b);
	n = b - 1;
	b /= 2;
	x[1] = b;
	y[1] = (n ^ b);
	long long int res[2][4], k = 1000000000, i, j;
	for (i = 0; i < 2; i++)
	{
		res[i][0] = (x[i] % k) * (y[i] % k);
		res[i][1] = (x[i] % k) * (y[i] / k) + (x[i] / k) * (y[i] % k);
		res[i][2] = (x[i] / k) * (y[i] / k);
		res[i][3] = 0;
		for (j = 0; j < 3; j++)
		{
			res[i][j + 1] += res[i][j] / k;
			res[i][j] %= k;
		}
	}
	for (j = 3; j >= 0; j--)
	{
		if (res[0][j] > res[1][j])
		{
			printf("%lld %lld\n", x[0], y[0]);
			return;
		}
		if (res[0][j] < res[1][j])
		{
			printf("%lld %lld\n", x[1], y[1]);
			return;
		}
	}
	printf("%lld %lld\n", x[0], y[0]);
	return;
}
int main()
{
	int t;
	scanf("%d", &t);
	for (; t > 0; t--)
		solve();
	return 0;
}