Alice and Bob have an array $a$ of $n$ integers. They decide to play a game with the array. In one move,

One must choose an index $i$ such that $a_i > 0$. After that, he sets the value of $a_i$ to $0$.

Alice and Bob make alternating moves: Alice makes the first move, Bob makes the second move, Alice makes the third one, and so on. If a player can't make any move, he/she loses. Who will win if both play optimally?

Input

The first line of the input contains one integer $t(1\leq t\leq 1000)$, the number of test cases.

In each test case, the first line contains an integer $n(1\leq n\leq50)$, the number of elements in $a$. The next line contains $n$ integers $a_1, a_2, \dots , a_n (0\leq a_i\leq 20)$, where $a_i$ is the $i^{th}$ element of $a$.

Output

For each test case, print the name of the winner in a single line. If Alice wins, print “Alice” (without quotes) otherwise print “Bob” (without quotes).

Sample

Input

Output

3
3
0 0 0
2
0 5
3
2 0 6

Bob
Alice
Bob

Sample Explanation:

In the $1^{st}$ case, Alice can’t make the first move. So, Bob wins. In the $2^{nd}$ case, Alice sets the value of $a_2$ to $0$ in the first move. As a result, Bob can’t make the second move. So, Alice wins. In the $3^{rd}$ case, Alice can set the value of $a_1$ to $0$ in the first move. After that, Bob will set the value of $a_3$ to $0$. As a result, Alice can’t make the third move. So, Bob wins. It can be showed that, if Alice chooses index $3$ in the first move, Bob will still win.