Taco Game Winner

You are given T test cases. In each test case, you are provided with an integer N (the number of elements in an array) followed by N integers. Bob starts the game, and the players take turns making a move. In each move, a player can remove one element from the array or increase/decrease any element by 1. The game ends when a player cannot make a move, and that player loses. Under optimal play, it can be deduced that if the size of the array is odd then Alice wins, otherwise Bob wins. Your task is to determine the winner for each test case.

Note: The underlying strategy can be summarized by the condition: if \( N \) is odd then Alice wins, and if \( N \) is even then Bob wins.

inputFormat

The first line of input contains a single integer T, the number of test cases. Each test case consists of a line containing an integer N (the number of elements in the array) followed by a line with N space-separated integers representing the array elements.

outputFormat

For each test case, output a single line containing either Alice or Bob based on who wins the game.

1
5
1 2 3 4 5

Alice