def jikken():
	A=[]
	for N in range(0,100):
		X=0
		Y=0

		# a=0
		# while 1<<(a+1)-1<=N:
		# 	a+=1
		# N=(1<<a)-1

		f=True
		for i in reversed(range(64)):
			if N&(2**i)>0:
				if f:
					X+=1<<i
					f=False
				else:
					Y+=1<<i
		
		if N>0 and X*Y<A[-1]:
			print(N-1,N,A[-1],X*Y)
		A.append(X*Y)
	print(A)
	
# jikken()
# print("OK")

def solve(N):
	X=0
	Y=0

	f=True
	for i in reversed(range(64)):
		if N&(2**i)>0:
			if f:
				X+=1<<i
				f=False
			else:
				Y+=1<<i
	
	return (X*Y,X,Y)

for _ in range(int(input())):
	N=int(input())

	ans=solve(N)

	a=0
	while (1<<(a+1))-1<=N:
		a+=1
	N=(1<<a)-1

	ans=max(ans,solve(N))

	print(ans[1],ans[2])