Problem Description

Each element in a sequence of positive integers of length $N$, $A = (A_1, A_2, \dots, A_N)$, is greater than or equal to $2$. Anna and Bruno play a game using these integers. They take turns performing the following operation, with Anna going first:

• Choose an integer $i$ (where $1 \leq i \leq N$). Select a positive divisor $x$ of $A_i$ that is not equal to $A_i$ itself, and replace $A_i$ with $x$.

The player who cannot perform an operation loses, and the other player wins. Determine which player wins when both play optimally to win.

Input Format

The input is given from the standard input in the following format:

$ N $ $ A_1 $ $ A_2 $ $\cdots$ $ A_N $

Output Format

Output Anna if Anna wins the game, or Bruno if Bruno wins the game.

Sample Input and Output

Sample Input #1

3
2 3 4

Sample Output #1

Anna

Sample Input #2

4
2 3 4 6

Sample Output #2

Bruno

Notes/Hints

Constraints

• $1 \leq N \leq 10^5$
• $2 \leq A_i \leq 10^5$
• All inputs are integers

Sample Explanation 1

For example, the game could proceed as follows. Note that this is not necessarily an example of both players acting optimally:
- Anna changes $A_3$ to $2$.
- Bruno changes $A_1$ to $1$.
- Anna changes $A_2$ to $1$.
- Bruno changes $A_3$ to $1$.
- Anna cannot perform an operation, so Bruno wins.

In reality, in this sample, Anna can always win if she acts optimally.

见题面 Input 部分

见题面 Output 部分