Nim is a game in which two players take turns removing stones from heaps. On each turn, a player must choose a single heap and remove one or more stones from that heap. The player who takes the last stone wins. Alice and Bob are bored with playing Nim over and over again, so they‘ve decided to create a new variation called Ordered Nim. Ordered Nim differs from regular Nim in the following way. The heaps are numbered 0 through n-1 (where n is the number of heaps), and a player can only remove stones from a heap if all the lower-numbered heaps are empty. You are given n interger(s), where the i-th interger(0-indexed) is the number of stones in heap i at the beginning of the game. Alice will take the first turn. Determine who will win the game, assuming both players play optimally.
input consist of multiple cases;process till EOF. each case contain two lines. on the first line is a interger n (1<=n<=50). the next line contain n interger(s),each of which will be between 1 and 1000000000,inclusive.
for each case output one line . if Alice can win print "Alice". otherwise print "Bob".