import math
import sys

def primegen(quantity):
    if quantity == 0:
        return []
    primes = [2]
    n = 3
    while (len(primes) < quantity):
        for p in primes:
            if (n%p == 0):
                n += 2
                break
            if (p*p > n):
                primes.append(n)
                n += 2
                break
    return primes

#alice first
p = primegen(10000)


g = int(raw_input().strip())
for a0 in xrange(g):
    n = int(raw_input().strip())
    c = 0
    for i in xrange(10000):
        if p[i]>n:
            c = i
            break
    if c%2 == 0:
        print "Bob"
    else:
        print "Alice"