单点时限: 1.0 sec
内存限制: 1024 MB
Alice and Bob are playing a game about stones.
There are $n$ piles of stones, the $i$-th pile of which initially contains $a_i$ stones.
They take turns to perform one of the following operations, starting from Alice.
The one who cannot perform any operation lose the game.
Suppose Alice and Bob play the game optimally, do you know who will win the game?
The first line contains an integer $n$ ($1 \leq n \leq 10^4$).
The second line contains $n$ integers $a_1, \dots, a_n$ ($1 \leq a_1, \dots, a_n \leq 10^5$).
Print Alice or Bob, the winner of the game.
10 14270 15338 11437 8641 28379 15164 20738 7458 21978 17434
Bob
4 1 1 1 1
Bob
The second line of the input of the first example is wrapped due to the limited space. All ten numbers are on a single line in the real input file.