#!/bin/python

import sys

result = [] 

def is_prime(i, ps): 
    for p in ps: 
        if i % p == 0: 
            return False 
    return True 

def next_prime_generator(n):
    i = 2 
    primes = [] 
    while i <= n:
        #print "i:"+str(i)
        if is_prime(i, primes):
            #print "yes prime"
            primes.append(i) 
            yield i 
        i += 1 

g = int(raw_input().strip())
for a0 in xrange(g):
    n = int(raw_input().strip())
    gen = next_prime_generator(n) 
    count = 0
    for p in gen: 
        count += 1  
    if count % 2 == 0:
        result.append("Bob")
    else:
        result.append("Alice")

for r in result:
    print r