Problem Statement

There is a multiset $S$ of integer sequences.

Initially, $S = \{(F_1, F_2, \ldots, F_N)\}$. Here, it is guaranteed that $F$ does not contain $0$.

For an integer sequence $A = (A_1, A_2, \ldots, A_K)$ with $A \in S$, splitting $A$ at position $i\ (1 \leq i \leq K)$ is defined as performing the following operations in order.

• If $i \neq 1$, add $(A_1 \oplus A_i, A_2 \oplus A_i, \ldots, A_{i-1} \oplus A_i)$ to $S$.
• If $i \neq K$, add $(A_{i+1} \oplus A_i, A_{i+2} \oplus A_i, \ldots, A_K \oplus A_i)$ to $S$.
• Remove $1$ copy of $A$ from $S$.

Alice and Bob play the following game using $S$.

Starting with Alice, the players alternately perform the following operation.
• Choose any integer sequence $A$ with $A \in S$ and an $i$ such that $1 \leq i \leq |A|$, and split $A$ at position $i$.
• However, an operation after which $S$ contains a sequence containing $0$ must not be performed.

Determine who wins when both players play optimally.

Input

$N$
$F_1\ F_2\ \ldots\ F_N$

All input satisfies the following constraints.

• $1 \leq N \leq 2 \times 10^5$
• $1 \leq F_i < 2^{30}$
• All input values are integers.

Output

If Alice wins when both players play optimally, print Alice; if Bob wins, print Bob. Print a newline at the end.

Sample

6
1 2 2 1 5 7

Bob

1
1

Alice