Bittijono

 
import java.util.Scanner;
 
public class Teht2 {
    
    public static void main(String[] args) {
        
        Scanner l = new Scanner(System.in);
        int k = l.nextInt();
        long[] m = new long[k];
        
        for (int i = 0; i < k; i++) {
            m[i] = l.nextLong();
        }
        
        for (long i : m) {
            System.out.println(Long.bitCount(i-1) % 2);
        }
 
        
//        System.out.println("" + Integer.bitCount(k));
        
    }
    
}
 

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED