After trying all the questions in DCEPC11, Saikat Sir was really pissed. To him the problems seemed way too easy and not challenging enough for the good coders out there. So he decides to add another problem, a horrible problem that no one will be able to solve.

He describes a game, played between Alice and Bob.

N bowling pins are placed in a line. In each move, Alice and Bob have to remove at least one and at most 2 pins, provided that the there is no gap and no other pin between these 2 pins. The winner of the game is the player who makes the last move. You have to tell that who will win the game, given that Alice makes the first move and both players play optimally.

Input

First line contains T, the number of test cases.

The next T lines each contain a number N, describing the number of bowling pins in the game initially.

Output

Output “Alice” if Alice will win the game, else output “Bob”.

Constraints

1 ≤ T ≤ 1000

1 ≤ N ≤ 10¹⁸

Example

Input:
1
2

Output:
Alice