Statment
Alice and Bob play the following game. They choose a number N to play with. The rules are as follows : 1) Alice plays first, and the two players alternate. 2) In his/her turn, a player can subtract from N any proper divisor (not equal to N) of 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 ?
Input :
The first line contains the number of test cases T. Each of the next T lines contains an integer N.
Output :
Output T lines, one for each test case, containing "ALICE" if Alice wins the game, or "BOB" otherwise.
Sample Input :
2
1
2
Sample Output :
BOB
ALICE
Constraints :
1 <= T <= 10000
1 <= N <= 1000000000
Note : For the first test case, Alice cannot make any move and hence Bob wins the game. For the second test case, Alice subtracts 1 from N. Now, Bob cannot make a move and loses the game.]
Hint:-Problem is based on basics of game theory.
Solution:-
Copy sample input in "Stdin Input"