def prime_numbers(x) :
    
    if x < 2 :
        return []
    
    prime = []
    for i in range(2, int(x**0.5) + 1) :
        while x % i == 0 :
            prime.append(i)
            x //= i

    if x > 1 :
        prime.append(x)
    
    return prime
##########################################################################
import functools
@functools.lru_cache(maxsize=10**8)
def f(x):
    s = set()
    if x >= 1: s.add(f(x-1))
    if x >= 2: s.add(f(x-2))
    for i in range(3):
        if i not in s:
            mex = i; break
    return mex
##########################################################################
def xor_sum(A):
    ret = 0
    for a in A: ret ^= a
    return ret
##########################################################################
from collections import Counter

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

prime = [prime_numbers(M[i]) for i in range(N)]

grundy_1 = 0
for i in range(N):
    grundy_2 = 0
    for j in Counter(prime[i]).values():
        grundy_2 ^= f(j)
    grundy_1 ^= grundy_2

print("Alice") if grundy_1 else print("Bob")