import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################


def solve(n):
    k = n.bit_length()
    if n == 0:
        return 0, 0, 0
    else:
        X = 2 ** (k - 1)
        Y = n - X
        return X * Y, X, Y
def solve2(n):
    if n == 0:
        return 0, 0, 0
    k = n.bit_length()
    return max(solve(n), solve(2 ** (k-1)-1))

def naive(n):
    ans = 0
    for i in range(n + 1):
        for j in range(n + 1 - i):
            if i & j == 0:
                ans = max(ans, i * j)
    return ans

# for i in range(100):
#     if naive(i) != solve2(i):
#         print(i)
#         print(naive(i), solve2(i))

# for i in range(100):
#     print(i, solve(i))

for _ in range(ni()):
    n = ni()
    res = solve2(n)
    print(res[1], res[2])