Sequence Folding Game

Alice and Bob play a sequence folding game. The game runs in this order.

1. Pick an integer $N$ that is at least 2.
2. Build a sequence of $N$ integers.
3. If $N$ is 2, jump to step 6.
4. Fold the sequence into a new one by adding the first number to the $N$th, the second to the $(N-1)$th, and so on. When $N$ is odd, the middle number is added to itself.
5. Replace $N$ with $\lceil N/2 \rceil$ and go back to step 3.
6. Two numbers are left. Alice wins when the first number is greater than the second, and Bob wins in every other case.

Given a sequence of $N$ integers, write a program that finds the winner of the game.

The first line has the number of test cases $T$ ($1 \le T \le 100$). Each test case starts with a line holding the length of the sequence $N$ ($2 \le N \le 100$), followed by a line with the $N$ integers of the sequence separated by spaces. Every integer fits in the signed 32-bit range.

For each test case print one line, either Case #x: Alice or Case #x: Bob, where $x$ is the test case number starting from 1. Print Alice when Alice wins and Bob when Bob wins.