Alice and Bob play the game, "Divide and Destroy".

At the beginning of the game, there is a bunch of stones with $n_i$ stones. Alice and Bob take turns (Alice is the first). In her turn, Alice can divide any bunch into two. The stones in these new piles are divided equally (if this cannot be done, one more stone is placed in one of them). Bob can destroy any bunch in his turn (pick it up and remove it from the game). If one of the players gets a situation where there is one stone in all the handfuls, he loses.

Which of them will win, with the optimal game of both players.

Input format

• The first line contains $t$ denoting the number of test cases.
• The second line contains $t$ numbers $n_i$. Each of these numbers describes a game in which the initial number of stones is $n_i$.

 Output format

You are required to print $t$ lines. Each of these lines contains the answer to the test. If Alice wins, print "Alice" and if Bob wins, print "Bob".

Constraints

$t ≤ 5 * 10^5$

$1≤n_i ≤ 10^{18}$