def resolve():
    n = int(input())
    m = list(map(int, input().split()))
    p = [PrimeFactorization(x) for x in m]
    s = 0
    for q in p:
        t = 0
        for i in q.values():
            t ^= i % 3
        s ^= t
    print("Alice" if s else "Bob")


def PrimeFactorization(n: int):
    pf = {}
    for i in range(2, int(n ** 0.5) + 1):
        while n % i == 0:
            pf[i] = pf.get(i, 0) + 1
            n //= i
    if n > 1:
        pf[n] = 1
    return pf


if __name__ == '__main__':
    resolve()