For this Question: You are given a number N. You need to Fix the middle bit of N in binary form and print the result in decimal form.

If number of bits in binary form of N are odd then Fix the middle bit (Like 111 to 101).
If number of bits in binary form of N are even then Fix both the middle bits (Like 1111 to 1001)

Note: Fixing a bit means converting a 0 to 1 and vice versa.The first line of input contains T denoting the number of test cases. T test cases follow. Each test case contains a single number N.

Constraints:
1 <= T <= 100
1 <= N <= 1000000For each test case, in a new line, print the decimal form after toggling the middle bit of N.Input:
5
1
2
3
4
5

Output:
0
1
0
6
7

Examples:
Test case 3: N = 3. Binary is 11. Toggle the middle bits: 00. 00 in decimal is 0
Test case 5: N = 5. Binary is 101. Toggle the middle bit: 111. 111 in decimal is 7, I have written this Solution Code: t=int(input())
while t>0:
    n=int(input())
    count=len(bin(n))-2
    if count%2!=0:
        print(n^(1<<(count//2)))
    else:
        n=n^(1<<(count//2))
        print(n^(1<<(count//2-1)))
    t-=1, In this Programming Language: Python, Now tell me if this Code is compilable or not?