N = 200000
div = [i for i in range(N)]
for i in range(2, int(N ** 0.5 + 1)):
    if div[i] != i:
        continue
    for j in range(i * i, N, i):
        if div[j] == j:
            div[j] = i



m = int(input())
A = list(map(int, input().split()))

memo = {():0}
def f(lst):
    tup = tuple(sorted(l for l in lst if l != 0))
    if tup in memo:
        return memo[tup]
    se = set()
    le = len(lst)
    for i in range(le):
        if lst[i] >= 1:
            lst[i] -= 1
            se.add(f(lst))
            lst[i] += 1
        if lst[i] >= 2:
            lst[i] -= 2
            se.add(f(lst))
            lst[i] += 2
    mex = 0
    while mex in se:
        mex += 1
    memo[tup] = mex
    return mex

xor = 0
for a in A:
    cnt = {}
    while a >= 2:
        cnt[div[a]] = cnt.get(div[a], 0) + 1
        a //= div[a]
    lst = sorted(cnt.values())
    xor ^= f(lst)

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