#素因数分解
def Prime_Factorization(N):
    if N<0:
        R=[[-1,1]]
    else:
        R=[]

    N=abs(N)
    k=2
    while k*k<=N:
        if N%k==0:
            C=0
            while N%k==0:
                C+=1
                N//=k
            R.append([k,C])
        k+=1

    if N!=1:
        R.append([N,1])
    if not R:
        R.append([N,1])

    return R
#================================================
N=int(input())
M=list(map(int,input().split()))

D=[]
for a in M:
    A=Prime_Factorization(a)
    for _,e in A:
        D.append(e)

X=0
for e in D:
    X^=e%3

if X:
    print("Alice")
else:
    print("Bob")