Nim Game
medium
Two players Alice and Bob are playing a game. They have n piles. ith pile conatins arr[i] no. of coins. In each move a player can choose a pile and remove as many coins as he wants (minimum 1 coin). The player who removes the last set of coins from table will win. Alice goes first.
Constraints
1<= n <= 10^5 1<= arr[i] <= 10^8
Format
Input
The first line contains integer n, no. of piles. second line contains n integer containing number of coins in each pile.
Output
Print the winner (ALICE or BOB).
Example
Sample Input
3
1 2 3
Sample Output
BOB
