def get_primes(size):
    is_prime = [True] * (size + 1)
    is_prime[0] = is_prime[1] = False
    primes = []
    for i in range(size + 1):
        if not is_prime[i]:
            continue
        primes.append(i)
        for j in range(i + i, size + 1, i):
            is_prime[j] = False
    return primes


N = int(input())
M = list(map(int, input().split()))
MAX = 10_000
S = [set(range(4)) for _ in range(MAX + 1)]
dp = [0] * (MAX + 1)
primes = get_primes(MAX)
for n in range(1, MAX + 1):
    dp[n] = min(S[n])
    for p in primes:
        if n * p > MAX:
            break
        S[n * p].discard(dp[n])
        if n * p * p <= MAX:
            S[n * p * p].discard(dp[n])
xor = 0
for m in M:
    xor ^= dp[m]
print('Alice' if xor > 0 else 'Bob')