Limits 10s, 64 MB

Alice and Bob played Nim for a long time and now they are pissed off after exploring the property of XOR related to sstandard Nim games. They have heard that XOR sum of the size of Nim piles produce perfect guess about the game if two players play optimally. But they are not fully convinced as they did not find any good mathematical proof of that model.

So they reduced the game into two pile and set up some new rules to observe the game more closely.

There are two pile of stones in their game. X1 and X2 represent the number of stones in each pile. In each move, a player will remove at least one or multiple stone(s) from one or both piles. When removing stones from both piles, the number of stones removed from each pile must be equal. The winner is the one who gives the last move.

Now, Alice will give the first move. Both of them will play optimally. You have to determine the winner of the game.

Input

Input starts with an integer T (≤ 100000), denoting the number of test cases. For each of the test case, there will be two integers X1(0 ≤ X1 ≤ 232) and X2(0 ≤ X2 ≤ 232).

Output

For each of the test case, print Alice if Alice wins. Otherwise Print Bob.

Sample

InputOutput
1
0 0
Bob

Submit

Login to submit.

Statistics

23% Solution Ratio
NirjhorEarliest, Feb '17
Kuddus.6068Fastest, 0.1s
nusuBotLightest, 4.9 MB
NirjhorShortest, 742B
Toph uses cookies. By continuing you agree to our Cookie Policy.