def bsr(x: int) -> int:
    """1 が立っている最上位ビットの位置を返す (0-indexed)"""
    assert x != 0
    return x.bit_length() - 1


def solve():
    N = int(input())
    if N.bit_count() <= 1:
        print(0, 0)
        return

    x = 1 << bsr(N)
    y = N ^ x
    print(x, y)


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