Alice and Bob play an interesting game. They start with a number “n” and follow some rules until the game ends. The rules for the game are:

1. Let F(n) denotes the total number of set bits in binary representation of numbers from 0 to (2^n) -1.
2. Each player plays alternatively until the game ends and one of them wins the game.
3. In each turn a player either unsets a single set bit from binary representation of “n” or unsets 2 consecutive set bits from the binary representation of “n”. Let’s call the resulting number after such move as “x”.
4. The game ends when F(x) is a power of 2. (0 is also a power of 2).
5. The player with no move loses the game and so other player wins the game.
6. Alice starts the game always.
7. Both of them play optimally.

Given “n” can you predict the winner of the game?

Input

First line contains T, the number of test cases.

Next T lines contains one integer per line, “n” (quotes for clarity).

Output

Output T lines, each containing either “Alice” if Alice wins the game or “Bob” if Bob wins the game. 

Constraints

1<=T<=10

0<=N<=10^6

Example

Input:
2
4
10

Output:
Bob
Alice