import sys,random,bisect
from collections import deque,defaultdict,Counter
from heapq import heapify,heappop,heappush
from itertools import cycle, permutations
from math import log,gcd

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

N = int(input())
A = li()

g = 0
for i in range(N):
    if i&1:
        g ^= A[i]

if g == 0:
    print("Bob")
else:
    print("Alice")