import sys

def is_prime(n):
    if n == 1:
        return False
    if n == 2:
        return True

    for i in xrange(2, n):
        if n % i == 0:
            return False
        if i * i > n:
            break
    return True

def gen_primes(n):
    primes = []
    for i in xrange(2, n + 1):
        if is_prime(i):
            primes.append(i)

    return sorted(primes)


def solve(n, primes):
    c = 0
    for p in primes:
        if p <= n:
            c += 1
        else:
            break

    if c % 2 == 0:
        return 'Bob'
    else:
        return 'Alice'

primes = gen_primes(100000)
g = int(raw_input().strip())
for a0 in xrange(g):
    n = int(raw_input().strip())
    print solve(n, primes)