import sys
read=sys.stdin.buffer.read
readline=sys.stdin.buffer.readline
readlines=sys.stdin.buffer.readlines

n=int(readline())
m=list(map(int, readline().split()))
def prime_sieve(n):
    isprime=[True]*(n+1)
    isprime[0]=False
    isprime[1]=False
    for i in range(2, n+1):
        if isprime[i]:
            for j in range(2*i, n+1, i):
                isprime[j]=False
    return isprime
mx=10000
isprime=prime_sieve(mx)
f=[[] for _ in range(mx+1)]
for p, b in enumerate(isprime):
    if not b:
        continue
    for i in range(p, mx+1, p):
        f[i].append(p)
dp=[0]*(mx+1)
for x in range(2, mx+1):
    st=set()
    for p in f[x]:
        x1=x//p
        st.add(dp[x1])
        if x1%p==0:
            st.add(dp[x1//p])
    for i in range(mx+1):
        if i not in st:
            dp[x]=i
            break
s=0
for x in m:
    s^=dp[x]
if s:
    print("Alice")
else:
    print("Bob")