#!/bin/python

import sys
#to check prime
def isprime(n):
    from math import sqrt
    ctr=0
    if n in [0,1]:
        return False
    for i in xrange(1,int(sqrt(n))+1):
        if n%i==0:
            ctr+=1
        if ctr>1:
            return False
    return True


#crosses factors of the primes
def cross(prime):
    global primes
    for i in xrange(prime*prime,len(primes),prime):
        primes[i]=False         

#picks next prime
def nextprime(prime):
    global primes
    next=prime+1
    while not primes[next] and next<sqrt(len(primes)):
      next+=1
    return next
from math import sqrt

alreadychecked={}

g = int(raw_input().strip())
for a0 in xrange(g):
    m = int(raw_input().strip())
    copy=alreadychecked.keys()[:]
    while True:
        try:
            if max(copy)>m:
                copy.remove(max(copy))
            else:
                ctr=alreadychecked[max(copy)]
                for i in xrange(max(copy)+1,m+1):
                    if isprime(i):
                        ctr+=1
                break
        except:
            primes=[True for i in xrange(m+1)]
            primes[0]=primes[1]=False
            for prime in xrange(2,int(sqrt(m))+1):
                cross(prime)
                prime=nextprime(prime)
            ctr=len([number for number in primes if number])
            break
    if m not in alreadychecked:
        alreadychecked[m]=ctr
    if ctr%2==0:
        print 'Bob'
    else:
        print 'Alice'