Bittijono

import java.util.Scanner;
 
public class Bits {
	static boolean par(long c) {
		long p = 0;
		while(c > 0) {
			p = p + (c & 1) % 2;
			c >>= 1;
		}
		return p % 2 == 0;
	}
	
	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
		
		int count = input.nextInt();
		long cur;
		
		for(int i = 0; i < count; i++) {
			cur = input.nextLong();
			System.out.println(par(cur-1) ? 0 : 1);
		}
		
		input.close();
	}
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED