def prime_factors(n):
    factors = {}
    while n % 2 == 0:
        factors[2] = factors.get(2, 0) + 1
        n = n // 2
    i = 3
    while i*i <= n:
        while n % i == 0:
            factors[i] = factors.get(i, 0) + 1
            n = n // i
        i += 2
    if n > 2:
        factors[n] = 1
    return factors

def main():
    import sys
    input = sys.stdin.read().split()
    N = int(input[0])
    M_list = list(map(int, input[1:N+1]))
    
    xor_sum = 0
    
    for m in M_list:
        if m == 1:
            continue
        factors = prime_factors(m)
        for p in factors:
            e = factors[p]
            grundy = e % 3
            xor_sum ^= grundy
    
    if xor_sum != 0:
        print("Alice")
    else:
        print("Bob")

if __name__ == "__main__":
    main()