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 java.io.*;
import java.util.*;



class Main {
	public static void main (String[] args) throws IOException{

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));


		int t = Integer.parseInt(br.readLine());
		while(t-->0){

			int n = Integer.parseInt(br.readLine());
			int count=0;
			for(int i=1;i<=Math.sqrt(n);i++){
					if(n%i == 0)
					{
						if(i%2==0) {
							count++;
						}
						if(i*i != n && (n/i)%2==0) {
							count++;
						}
					}


















			}


			System.out.println(count);
		}
	}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?