def f(n):
    x = 0
    y = 0
    for i in range(60):
        if n >> i & 1:
            x = 1 << i
            y |= x

    return y - x, x


def solve():
    n = int(input())
    if n == 0:
        print(0, 0)
        return

    x, y = f(n)
    n2 = 1 << (n.bit_length() - 1)
    x2, y2 = f(n2 - 1)
    if x * y > x2 * y2:
        print(x, y)
    else:
        print(x2, y2)


for _ in range(int(input())):
    solve()