Alice and Bob are playing a game. Initially there are $n$ positive numbers, the $i$-th number is $a_i$. In one turn, Alice can choose an odd number and divide it into two positive numbers, or delete a number equals to 1. Bob can choose an even number and divide it into two positive numbers. Two players move in turns, and Alice move first. In one's turn, if he or she can't move, he or she lose the game. If two player move optimally, please find out who the winner is.

You need to answer $T$ queries.

First line contains one integer $T \ (1\leq T \leq 10^3)$.

In each query:

First line contains one integer $n \ (1\leq n\leq 10^5)$.

Second line contains $n$ integers, the $i$-th integer is $a_i \ (1\leq a_i \leq 10^9)$.

The sum of $n$ is less than $2\times 10^5$.

In each query, print Aliceif Alice is the winner, print Bob otherwise.

In first query, there are no odd number, Alice can not make a move, so Bob wins.

In second query, Alice can delete $1$, the list becomes $[2]$. Bob can divide $2$ into $1,1$, the list becomes $[1,1]$. Then, Alice can delete $1$, the list becomes $[1]$. Now Bob can't make a move, so Alice wins.