Subsequence Sum Game

In the Subsequence Sum Game, two players, Alice and Bob, compete by selecting subsequences from a given array of integers. A subsequence is any sequence that can be derived by deleting some or no elements without changing the order of the remaining elements. The sum of a subsequence is defined to be even if and only if it is divisible by 2, i.e. it satisfies the condition $$S \mod 2 = 0$$.

The game is played as follows:

• For each test case, an array of integers is provided.
• Alice always makes the first move and both players play optimally.
• If the given array contains at least one even number, Alice will win; otherwise, Bob will win.

Your task is to determine the winner for each test case.

inputFormat

The first line of input contains an integer T, the number of test cases. Each test case consists of:

• An integer N denoting the number of elements in the array.
• A line of N space-separated integers representing the array elements.

All input is read from stdin.

outputFormat

For each test case, output a single line containing the winner's name, either "Alice" or "Bob". The result for each test case should be printed in the same order as the input test cases, with each output written on a new line to stdout.

## sample

3
3
2 4 6
4
1 3 5 7
1
2

Alice
Bob
Alice

</p>