import math



def prime(k,n):
    b=[]
    if k==1:
      k=k+1
    l=0
    a=[1]*(n-k+1)
    for x in range(2,int(math.sqrt(n))+1):

        for y in range(2*x,n+1,x):
            if y%x==0:
                a[y-k]=0
                l=l+1
    for m in range(0,n-k+1):
        if a[m]==1:
            b=b+[m+k]
    return b



t=input()
max=0
arr=[]
for i in range(t):
    x=input()
    arr=arr+[x]
    if x>=max:
        max=x

ar=prime(1,max)


for i in range(len(arr)):
    count=0
    for k in range(len(ar)):
        if arr[i]>=ar[k]:
            count=count+1
        else :
            break

    if  count%2==1:
            print 'Alice'
    else:
            print 'Bob'