For this Question: Given an integer N, the task is to find the number of divisors of N which are divisible by 2.The input line contains T, denoting the number of testcases. First line of each testcase contains integer N

Constraints:
1 <= T <= 50
1 <= N <= 10^9For each testcase in new line, you need to print the number of divisors of N which are exactly divisble by 2Input:
2
9
8

Output
0
3, I have written this Solution Code: import math

n = int(input())
for i in range(n):
    x = int(input())
    count = 0
    for i in range(1, int(math.sqrt(x))+1):
        if x % i == 0:
            if (i%2 == 0):
                count+=1
            if ((x/i) %2 == 0):
                count+=1

    print(count), In this Programming Language: Python, Now tell me if this Code is compilable or not?