from math import sqrt
def prime_factorization(N):
    ret = {}
    for i in range(2,int(sqrt(N))+1):
        if N % i == 0:
            ret[i] = 0
            while N % i == 0:
                ret[i] += 1
                N //= i
    if N > 1:
        ret[N] = 1
    return ret

M = 10000
grundy = [0] * (M+1)
for i in range(2,M+1):
    for v in prime_factorization(i).values():
        grundy[i] ^= v % 3
N = int(input())
M = list(map(int,input().split()))
nim = 0
for i in range(N):
    nim ^= grundy[M[i]]
if nim:
    print('Alice')
else:
    print('Bob')