#yukicoder3088 XOR equal SUM

def brute(N):
    ans = X = Y = 0
    for x in range(N + 1):
        for y in range(N + 1):
            if N >= x + y == x ^ y and ans < x * y:
                ans, X, Y = x * y, x, y
    return X, Y

def solve(N):
    if N <= 2:
        return 0, 0
    d = N.bit_length() - 1  #最高位

    #1. X == 1 << d, Y = else
    X1, Y1 = 1 << d, N - (1 << d)

    #2. X == 1 << d - 1, Y = ~ ( - 1 << d)
    X2, Y2 = 1 << d - 1, ~ (- 1 << d - 1)

    #答えを出力  多倍長整数最高！
    return (X1, Y1) if X1 * Y1 > X2 * Y2 else (X2, Y2)

#実行
for _ in range( T := int(input()) ):
    print( *solve( N := int(input()) ) )