Bittijono

import java.util.Scanner;

public class Bittijono
{
    public static void main(String args[])
    {
        Scanner inputTaker = new Scanner(System.in);
        int times = inputTaker.nextInt();
        
        long[] placesOfBits = new long[times];
        
        for(int i = 0; i < times; i++)
        {
            placesOfBits[i] = inputTaker.nextLong();
        }
        
        for(int i = 0; i < times; i++)
        {
            printNumberAtK(placesOfBits[i]);
        }
    }
    
    public static void printNumberAtK(long k)
    {
        int amountOfExponents = 0;
        int lastExponent;
        for(int i = 0; true; i++)
        {
            int exponent = (int) (Math.log(k) / Math.log(2) + 0.000000000000000000000000000001);
            k -= (int) (Math.pow(2, exponent) + 0.000000000000000000000000000001);
            amountOfExponents++;
            if(k == 0)
            {
                lastExponent = exponent;
                break;
            }
        }
        int numberAtK = lastExponent % 2;
        if(amountOfExponents % 2 == 0)
        {
            if(numberAtK == 0) numberAtK = 1;
            else numberAtK = 0;
        }
        System.out.println(numberAtK);
    }
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED