Taco Game Outcome

In this problem, you are given several test cases of a game sequence. For each test case, a sequence of integers is provided. The winner is determined based on the following rule: if there exists at least one even number in the sequence, then the winner is (\textbf{Anka}); otherwise, the winner is (\textbf{Boris}). Formally, for a sequence (a_1, a_2, \ldots, a_N), if (\exists i) such that (a_i \bmod 2 = 0), then output (\textbf{Anka}); else, output (\textbf{Boris}).

inputFormat

The input begins with an integer (T) denoting the number of test cases. Each test case consists of two lines. The first line contains an integer (N) indicating the number of elements in the sequence. The second line contains (N) space-separated integers representing the sequence.

outputFormat

For each test case, output a single line containing the winner of the game: either (Anka) or (Boris).## sample

1
3
2 4 6

Anka