For this Question: Given a number N in decimal form, you have to cyclically rotate left the binary representation of number N in 31 bit, you get the maximum number that can be formed.
Note:- All the leftover bits in binary representation of N are filled with zeroes i.e binary representation of 4 will be :- 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0The input contains T, denoting the number of testcases. Each testcase contains a number <b>N</b>.

Constraints:
1 <= T <= 100
1 <= N <= (2^32)-1For each testcase in new line print the maximum number formed.Input:
2
1
0

Output:
2147483648
0

Explanation:
Test case 1:- The binary representation of 1 is 0 0 0 . . . . . 1 when we make a cyclic shift to the left the number will become 1 0 0 0 0.......... 0 0 0 0. which is the maximum number that can be formed.
Test case 2:- The binary representation of 0 is 0, even if we left shift its binary numbers we still get 0 for that., I have written this Solution Code: import java.io.*;
import java.util.*;



class Main {
    static final int BITS =32;
    public static void main (String[] args) {


                      Scanner sc =new Scanner(System.in);
                      int t = sc.nextInt();
                      for(int i=1;i<=t;i++){
                          int number = sc.nextInt();
                        long ans = shifted(number);
                          System.out.println(ans);
                      }
    }
    public static long shifted(int n){
        long m =n;
        long max = n;
        for(int i=1;i<=32;i++){
            m=(n << i) | (n >>(BITS-i));
            if(m>max){
                max = m;
            }
        }
        return max*2;
    }
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?