def primes_sieve(limit):
    limitn = limit+1
    not_prime = [False] * limitn
    primes = []

    for i in range(2, limitn):
        if not_prime[i]:
            continue
        for f in range(i*2, limitn, i):
            not_prime[f] = True

        primes.append(i)

    return primes           
                
g = int(input().strip())
a = primes_sieve(10**5+1)
for a0 in range(g):
    n = int(input().strip())
    primecount = 0
    i = 0
    while i < len(a) and a[i] <= n:       
        i += 1
        primecount += 1
    
    if primecount % 2 == 0:
        print("Bob")
    else:
        print("Alice")