import sys, math
sys.setrecursionlimit(1000000)
INF = 1 << 100
#mod = 1000000007
mod = 998244353
input = lambda: sys.stdin.readline().rstrip()
li = lambda: list(map(int, input().split()))

def min_factors(N):
    N += 1
    min_fact = [i for i in range(N)]
    min_fact[0] = min_fact[1] = -1
    for i in range(2, N):
        if not min_fact[i] == i:
             continue
        for j in range(i, N, i):
            if min_fact[j] == j:
                min_fact[j] = i
    return min_fact


from collections import defaultdict
def factorization(x, min_fact):
    dic = defaultdict(int)
    while x > 1:
        dic[min_fact[x]] += 1
        x //= min_fact[x]
    ret = [(i, j) for i, j in dic.items()]
    return ret

def f(cnt):
    lst = [0] * (cnt+1)
    lst[0] = 0
    for i in range(1, cnt+1):
        tmp = [0] * 4
        for j in range(1, 3):
            if i - j >= 0:
                tmp[lst[i-j]] = 1
        for k in range(4):
            if not tmp[k]:
                lst[i] = k
                break
    return lst[-1]

mf = min_factors(10**4)
N = int(input())
M = li()
x = 0
for m in M:
    dic = factorization(m, mf)
    for _, v in dic:
        x ^= f(v)

if x:
    print('Alice')
else:
    print('Bob')