Stone Taking Game 2

Problem Description

There are $n$ piles of stones, the $i$-th pile containing $a_i$ stones. Alice and Bob take turns removing stones, with Alice moving first. In each turn, a player chooses one pile and removes some positive number of stones from it (they may take the whole pile, but must take at least one stone). The player who takes the last stone wins. Determine the winner.

Input Format

The first line contains an integer $T$ ($1 \le T \le 100$), the number of test cases.

For each test case:

• The first line contains an integer $n$ ($1 \le n \le 100$), the number of piles.
• The next line contains $n$ integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 10^9$), the sizes of the piles.

Output Format

Output $T$ lines, one per test case, each containing Alice or Bob indicating the winner.

Sample Input

3
3
1 2 3
2
1 2
2
5 5

Sample Output

Bob
Alice
Bob