Alice and Bob are playing a game. Alice gave Bob four types of characters 'a', 'b', 'c' and 'd' each having a count of A, B, C, and D respectively.

Alice allows Bob to do the following operation as many times he wants:

. choose 'a', 'b' and 'c' and change them to the character 'd'.More formally in one operation we need to decrease one occurence of each 'a','b','c' and convert them to 'd' hence increasing occurence of 'd' by 3.

Bob has to arrange the characters in such a way that after some number of operations the resulting arrangement is a palindrome.

If Bob fails to do so Alice wins the game otherwise Bob wins.

Input Format

The first line contains one integer T, denoting the number of test cases.

For each of the next T lines, each line contains four integers A, B, C, and D.

Constraints

1 ≤ T ≤ 300,
0 ≤ A, B, C, D ≤ 10^9

Output Format

For each test case print 'Bob' if Bob wins otherwise print 'Alice' after a certain number of operations( possibly zero ).