import sys from operator import itemgetter from collections import defaultdict, deque import heapq from heapq import heapify, heappop, _heapify_max, heappush from bisect import bisect_left, bisect_right import math import itertools import copy stdin=sys.stdin #sys.setrecursionlimit(10 ** 7) #import pypyjit #pypyjit.set_param('max_unroll_recursion=-1') ip=lambda: int(sp()) fp=lambda: float(sp()) lp=lambda:list(map(int,stdin.readline().split())) sp=lambda:stdin.readline().rstrip() Yp=lambda:print('Yes') Np=lambda:print('No') inf = 1 << 60 mod = 10 ** 9 + 7 mod = 998244353 eps = 1e-9 sortkey1 = itemgetter(0) sortkey2 = lambda x: (x[0], x[1]) # sort(key=lambda x:(x[1], x[2])) def factorization(n): arr = [] temp = n for i in range(2, int(-(-n**0.5//1))+1): if temp%i==0: cnt=0 while temp%i==0: cnt+=1 temp //= i arr.append([i, cnt]) if temp!=1: arr.append([temp, 1]) if arr==[]: arr.append([n, 1]) return arr ############################################################### N = ip() M = lp() grundy = [0 for _ in range(10000+1)] for i in range(2,10001): arr = factorization(i) mex = [0 for _ in range(101)] # 遷移先のgrundyをかきあつめ、mexをとる for p, _ in arr: mex[grundy[i//p]] += 1 if i%(p*p) == 0: mex[grundy[i//(p*p)]] += 1 res = 0 while mex[res]: res += 1 grundy[i] = res ans = 0 for m in M: ans ^= grundy[m] if ans: print('Alice') else: print('Bob')