Alice and Bob are playing a game. Initially there are  positive numbers, the -th number is . 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  queries.

First line contains one integer  ().

In each query:

First line contains one integer  ().

Second line contains  integers, the -th integer is  ().

The sum of  is less than .

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

4
3
2 4 6
2
1 2
3
1 1 4
4
2 2 3 6

Bob
Alice
Alice
Bob

In first query, there are no odd number, Alice can not make a move, so Bob wins.
In second query, Alice can delete , the list becomes . Bob can divide  into , the list becomes . Then, Alice can delete , the list becomes . Now Bob can't make a move, so Alice wins.