There is a row of cells, numbered from to . The -th cell is called to be adjacent to the -th cell if and only if .

There are three chess pieces: red, green, and blue. The red piece is located at the -th cell, the green piece is located at the -th cell, and the blue piece is located at the -th cell. (Different pieces may occupy the same cell.)

Alice and Bob take turns performing the following operation, with Alice going first:

• Select a chess piece and move it to an adjacent cell (different pieces may occupy the same cell).

If, after a move, the ordered triple formed by the positions of the three pieces has appeared at some previous moment, the player who made that move loses, and the other player wins. (The initial state is considered to have appeared before.)

Assuming both players adopt an optimal strategy, who will win the game?

Input consists of multiple test cases.

The first line contains an integer  (), indicating the number of test cases.

Following that are  lines, each containing four positive integers  (). These represent a query, where  are the initial positions of the red, green and blue chess pieces, respectively.

It is guaranteed that .

For each test case, if Alice wins, please output “Alice”; otherwise, please output “Bob”.

2
2 2 2 2
3 3 3 3

Alice
Bob