For this Question: For a given positive integer N, determine if there exist three <b>positive</b> integers a, b and c such that the following two conditions hold:

1. a + b + c = N
2. a ^ b ^ c = 0 where ^ denotes the bitwise XOR operation.

If there exist such a triple (a, b, c), print the lexicographically smallest one.
Else, print -1.The first line of input contains a single integer, T.
T lines follow, each containing a single integer, N.

<b>Constraints:</b>

1 <= T <= 10<sup>3</sup>
3 <= N <= 10<sup>18</sup>For each test, in a new line, print the lexicographically smallest triple (a, b, c) if it exists, else print -1.Sample Input:
3
3
6
12

Sample Output:
-1
1 2 3
2 4 6, I have written this Solution Code: for _ in range(int(input())):
    n = int(input())
    if n%2 or n<6:
        print(-1)
        continue
    m = n//2
    sl = 1
    while m % 2 == 0:
        m >>= 1
        sl <<= 1
    if n == sl*2:
        print(-1)
        continue
    print(sl,n//2-sl,n//2), In this Programming Language: Python, Now tell me if this Code is compilable or not?