Fibonacci Game Winner

In this problem, Alice and Bob engage in a turn-based game involving Fibonacci numbers. Initially, an array is formed using the first m Fibonacci numbers (starting with \(F(1)=1\) and \(F(2)=2\)). In each move, the current player selects one Fibonacci number from the array and divides it by another Fibonacci number (greater than 1) such that the division results in an integer. The selected number is then replaced by the quotient. If a player cannot make a valid move, they lose and the other player wins.

After careful analysis, it turns out that the outcome of the game depends solely on whether m is odd or even. Specifically, if m is odd, Alice (who goes first) wins; otherwise, Bob wins.

Your task is to determine the winner for each test case.

inputFormat

The first line of input contains a single integer t denoting the number of test cases. This is followed by t lines, each containing an integer m representing the number of Fibonacci numbers in the game.

Input is read from standard input (stdin).

outputFormat

For each test case, output a single line containing either Alice or Bob, indicating the winner of the game. Output is written to standard output (stdout).

## sample

2
5 8

Alice
Bob

</p>