Determining the Winner in an Optimal Game

You are given a number of game scenarios. In each scenario, two players take turns making moves. Each scenario is described by an integer n followed by n integers representing the moves or elements in the game setup. Both players are assumed to play optimally.

It turns out that by using a mirror strategy, the second player can always force a win. Your task is to determine the winner for each scenario. In every case the winner is Bob (the second player).

Formally, for each test case, you are given an integer T representing the number of test cases. Then for each test case, the first number is n followed by n space-separated integers. For each test case, output the name of the winning player.

Note: If any formulas are needed, use the LaTeX format. For example: \(f(n)=\sum_{i=1}^{n} a_i\).

inputFormat

The input begins with a single integer T representing the number of test cases.

Each test case is described in a single line as follows:

• The first integer is n (the number of elements for that game scenario).
• Followed by n space-separated integers representing the game moves or elements.

Input is provided via standard input (stdin).

outputFormat

For each test case, output a single line containing the name of the winning player. In this problem, the winning player is always Bob.

Output should be written to standard output (stdout).

## sample

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

Bob
Bob

</p>