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: #include <bits/stdc++.h>
using namespace std;
int main(){



int t;
cin>>t;
while(t--){
    long long n;
    cin>>n;
    if(n&1){cout<<0<<endl;continue;}
    long x=sqrt(n);
    int cnt=0;
    for(long long i=1;i<=x;i++){
        if(!(n%i)){
            if(!(i%2)){cnt++;}
            if(i*i!=n){
                if(!((n/i)%2)){cnt++;}
            }
        }

    }
    cout<<cnt<<endl;}
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not?