Candy Jar Game Winner Predictor

In this problem, two players (Alice and Bob) play a game with n jars of candies. The game is analogous to the classical Nim game. Each jar contains a certain number of candies. The outcome of the game can be determined using the XOR property: if the bitwise XOR of all candy counts $\left(\bigoplus_{i=1}^{n} a_i\right)$ equals 0, then the position is losing for the first player (Alice) and Bob wins; otherwise, Alice wins. Your task is to determine the winner given the initial candy distribution in the jars.

inputFormat

The input consists of two lines. The first line contains an integer $n$ ($1 \le n \le 10^5$) representing the number of jars. The second line contains $n$ space-separated integers, where each integer $a_i$ ($0 \le a_i \le 10^9$) denotes the number of candies in the $i$-th jar.

outputFormat

Output a single line containing the winner's name: either 'Alice' or 'Bob'.## sample

3
3 4 5

Alice