import sys
from math import sqrt


def get_needed_primes(m, n):
    primes = [2]
    for i in range(3, 32000, 2):
        isprime = True

        cap = sqrt(i) + 1

        for j in primes:
            if (j >= cap):
                break
            if (i % j == 0):
                isprime = False
                break

        if (isprime):
            primes.append(i)

    if (m < 2):
        m = 2
    isprime = [True] * 1000001
    for i in primes:
        if (1 >= cap):
            break

        if (i >= m):
            start = i * 2
        else:
            start = m + ((i - m % i) % i)

        falseblock = [False] * len(isprime[start - m:n + 1 - m:i])
        isprime[start - m:n + 1 - m:i] = falseblock

    return_list = []
    for i in range(m, n + 1):
        if (isprime[i - m] == True):
            return_list.append(i)

    return return_list

needed_primes = get_needed_primes(1, 100000)
g = int(raw_input().strip())
for a0 in xrange(g):
    n = int(raw_input().strip())
    number = 0
    for a_prime in needed_primes:
        if a_prime <= n:
            number+=1
        else:
            break

    if number % 2 == 0:
        print "Bob"
    else:
        print "Alice"