import math, bisect

def sieve(n):
    root = int(math.sqrt(n))
    primes = set([2] + range(3,n+1,2))  # assume n >= 2
    for p in xrange(3, root+1, 2):
        if p not in primes: continue
        for x in xrange(p*p, n+1, p):
            primes.discard(x)
    l = list(primes)
    l.sort()
    return l

p = sieve(100000)

def numPrimes(n):
    return bisect.bisect_right(p, n)

if __name__ == "__main__":
    g = int(raw_input())
    while g:
        g -= 1
        n = int(raw_input())
        if numPrimes(n) % 2 == 0:
            print "Bob"
        else:
            print "Alice"