#N,K=map(int, input().split())
#A=list(map(int, input().split()))
N=int(input())
A=list(map(int, input().split()))
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr
c=0
D={}
def f(A):
  AA=tuple(A)
  if sum(A)==0:
    return 0
  elif AA in D:
    return D[AA]
  else:
    C=[]
    for i in range(len(A)):
      AA=A.copy()
      if AA[i]>0:
        AA[i]-=1
        AA=sorted(AA)
        C.append(f(AA))
      AA=A.copy()
      if AA[i]>1:
        AA[i]-=2
        AA=sorted(AA)
        C.append(f(AA))
    C=set(C)
    for i in range(200):
      if i not in C:
        cc=i
        break
    D[tuple(A)]=cc
    return cc
  
c=0
for a in A:
  B=factorization(a)
  C=[]
  for x,y in B:
    C.append(y)
  cc=f(C)
  c^=cc
if c==0:
  print('Bob')
else:
  print('Alice')