# Sieve generator for primes (not by me)
def sieve():
    D = {}
    q = 2
    while True:
        if q not in D:
            yield q
            D[q * q] = [q]
        else:
            for p in D[q]:
                D.setdefault(p + q, []).append(p)
            del D[q]
        q += 1

g = int(input().strip())
for a0 in range(g):
    n = int(input().strip())
    primes = []
    gen = sieve()
    while not primes or max(primes) <= n:
        primes.append(next(gen))
        
    if len(primes) % 2 == 0:
        print('Alice')
    else:
        print('Bob')