# Winner In Nim Game

medium

Given an array of integers, two players Alice and Bob are playing a game where Alice can remove any element from the array.If the bitwise XOR of all remaining elements equals 0 after removal of selected element, then that player looses.Find out winner if both of the players play optimally. Alice starts the game first. In case case one-element in array consider its value as the XOR of array

## Constraints

1<= n <= 10^5 1<= arr[i] <= 10^8

## Format

### Input

The first line contains integer n, no. of integers. second line contains n integers arr[1],arr[2]...arr[n].

### Output

Print the winner (Alice or Bob).

## Example

Sample Input

5
15 6 9 10 20

### Sample Output

Bob