# 4330. Divide and Merge

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.

147 人解决，166 人已尝试。

157 份提交通过，共有 337 份提交。

2.4 EMB 奖励。