#K34927. Taco Game

    ID: 25418 Type: Default 1000ms 256MiB

Taco Game

Taco Game

You are given a game where two players, Alice and Bob, take turns removing elements from a list. Alice always goes first. However, their moves do not affect the outcome of the game: the winner is determined solely by the number of elements in the list.

For each test case, you are given an integer \(N\) (the number of elements in the list) followed by \(N\) integers (which can be positive, negative, or zero, but they do not affect the decision).

The rule is simple:

  • If \(N \mod 2 = 0\) (i.e. \(N\) is even), then Alice wins,
  • Otherwise, if \(N\) is odd, Bob wins.

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

inputFormat

The first line contains a single integer \(T\) representing the number of test cases.

For each test case, there is one line containing \(N+1\) integers. The first integer \(N\) denotes the number of elements in the list, and the following \(N\) integers represent the elements of the list.

Note: The actual values of the list elements do not affect the outcome.

outputFormat

For each test case, print a single line containing either "Alice" or "Bob" indicating the winner.

## sample
3
3 -1 2 3
4 10 -5 4 7
2 11 -11
Bob

Alice Alice

</p>