Problem #4330 - ECNU Online Judge

单点时限: 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.

Split one pile of stones of odd number into two piles. Neither of the two split piles can be empty.
Merge two piles of stones of even number into one pile.

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.

Input

10
14270 15338 11437 8641 28379 15164 20738 7458 21978 17434

Output

Bob

Input

4
1 1 1 1

Output

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.

156 人解决，176 人已尝试。

167 份提交通过，共有 360 份提交。

2.3 EMB 奖励。

创建: 2 年，7 月前.

修改: 2 年，7 月前.

最后提交: 1 月，2 周前.

来源: N/A

4330. Divide and Merge