#!/usr/bin/env python3

import array
import functools
import operator


def mex(s):
    m = 0
    for x in sorted(s):
        if x == m:
            m += 1
        else:
            break
    return m


def distinct_factors(n, typecode="I"):
    fs = array.array(typecode)
    for i in range(2, n):
        if i * i > n:
            break
        elif n % i == 0:
            fs.append(i)
            while n % i == 0:
                n //= i
    if n > 1:
        fs.append(n)
    return fs


def can_alice_win(ms):
    max_m = max(ms)
    factors_table = list(map(distinct_factors, range(0, max_m + 1)))
    gs = array.array("I", (0 for _ in range(max_m + 1)))
    for i in range(2, max_m + 1):
        next_gs = set()
        for f in factors_table[i]:
            next_gs.add(gs[i // f])
            if i % (f * f) == 0:
                next_gs.add(gs[i // f // f])
        gs[i] = mex(next_gs)
    return functools.reduce(operator.xor, (gs[m] for m in ms)) > 0


def main():
    _ = input()
    ms = array.array("I", map(int, input().split()))
    print("Alice" if can_alice_win(ms) else "Bob")


if __name__ == '__main__':
    main()