#!/usr/bin/env python3
from collections import defaultdict


def memoize(fn):
    table = {}

    def func(*args):
        if args not in table:
            table[args] = fn(*args)
        return table[args]
    return func


def prime_factorization(n):
    factor = defaultdict(int)
    i = 2
    while i * i <= n:
        while n % i == 0:
            n = n // i
            factor[i] += 1
        i += 1
    if n > 1:
        factor[n] += 1
    return factor


@memoize
def nim(nums):
    if sum([sum(n) for n in nums]) == 0:
        True
    for s in range(len(nums)):
        for i in range(len(nums[s])):
            for j in (1, 2):
                if nums[s][i] < j:
                    continue
                foo = list(nums)
                tmp = list(nums[s])
                tmp[i] -= j
                foo[s] = tuple(sorted(tmp))
                if nim(tuple(sorted(foo))):
                    return False
    return True

N = int(input())
M = [int(x) for x in input().split()]
init = []
for m in M:
    init.append(tuple(sorted(prime_factorization(m).values())))
if nim(tuple(sorted(init))):
    print("Bob")
else:
    print("Alice")