l=0
def find(primes,q):
    low=0
    high=l
    if q==2:
        return 1
    if q==1:
        return 0
    
    
    while True:
        mid=(low+high)/2
        if primes[mid]==q:
            return mid
        elif primes[mid]<q:
            if primes[mid+1]>q:
                return mid
            else:
                low=mid+1
                pass
            pass
        else:
            high=mid-1
            pass
        pass
    pass


g = int(raw_input())
num=[]
max_n=0

for a0 in xrange(g):
    n = int(raw_input())
    num.append(n)
    if max_n<n:
        max_n=n
        pass
    pass

nset=[1]*(max_n-1)
primes=[]

for x in xrange(2,max_n+1):
    if nset[x-2]!=1:
        continue
        pass
    else:
        primes.append(x)
        y=1
        while y*x<=max_n:
            nset[y*x-2]-=1
            y+=1
            pass
        pass
    pass
primes.append(max_n+1)
primes=[1]+primes
l=len(primes)

for q in num:
    result=find(primes,q)
    if result%2==1:
        print 'Alice'
        pass
    else:
        print 'Bob'
        pass
    pass