Taco Stone Game

Alice and Bob play a stone removal game. They take turns removing 1, 2, or 3 stones from a pile. Alice starts first and the players continue to play until one of them cannot make a move. The key observation is that if the number of stones N satisfies \(N \bmod 4 = 0\), then the current player is in a losing position. Otherwise, the current player can always force a win.

Given multiple test cases, determine the winner for each game by checking the condition \(N \bmod 4 = 0\). Output "ALICE" if Alice wins and "BOB" if Bob wins.

inputFormat

The input is read from standard input (stdin). The first line contains a single integer T, the number of test cases. Each of the following T lines contains a single integer N representing the initial number of stones in the pile.

outputFormat

For each test case, output a single line on standard output (stdout) containing either "ALICE" or "BOB" indicating the winner of the game.

1
1

ALICE