Determine the Winner in Aptos-Benji Game

Aptos and Benji are playing a strategic game using an array of n integers. The game proceeds in rounds with the players taking turns, starting with Aptos. In each round, the current player must choose any positive integer from the array and remove it. Then, every remaining element in the array is decreased by one. A player loses if they cannot make a valid move (i.e. when there is no positive integer available to remove).

Both players play optimally. It can be shown that the outcome is determined solely by the number of distinct positive integers in the array. Formally, if we define $$ D = \left|\{ x \in \text{arr} : x > 0 \}\right|, $$ then Aptos wins if \(D\) is odd and Benji wins if \(D\) is even.

Your task is to determine the winner given the initial configuration of the array.

inputFormat

The input is read from standard input (stdin) and consists of two lines:

1. The first line contains a single integer n, the number of elements in the array.
2. The second line contains n space-separated integers representing the array elements.

outputFormat

Output to standard output (stdout) a single line containing either Aptos or Benji according to who wins the game.

## sample

5
2 3 4 1 3

Benji

</p>