codechef-april

numgame2.c

/*Problem description
Alice and Bob play the following game.They choose a number N to play with.The runs are as follows : 
1.Bob plays first and the two players alternate. 
2.In his/her turn ,a player can subtract from N any prime number(including 1) less than N.The number thus obtained is the new N. 
3.The person who cannot make a move in his/her turn loses the game. 
Assuming both play optimally,who wins the game ?
*/
/*solution*/

#include<stdio.h>

int main(void)
{
	int testcases,input,lost_check;
	scanf("%d",&testcases);
	
        while(testcases>0)
	{
		lost_check = 0;
		scanf("%d",&input);
		if(input==1)
		{
			lost_check =1; 
		}
		else if((input-1)%4==0)
		{
			lost_check = 1;
		}
		
		if(lost_check)
		printf("ALICE\n");
		else
		printf("BOB\n");
		testcases--;
	}
	return 0;
}