#!/bin/python

def get_primes(lim):
    lower = 2
    upper = lim
    counter = 0
    for num in range(lower, upper + 1):
        counter += 1
        for i in range(2,(num/2)+1):
            if (num % i) == 0:
                # print num
                counter -= 1
                break
    return counter

def primes_sieve1(limit):
    limitn = limit+1
    primes = dict()
    for i in range(2, limitn): primes[i] = True

    for i in primes:
        factors = range(i,limitn, i)
        for f in factors[1:]:
            primes[f] = False
    return [i for i in primes if primes[i]==True]

PRIMES = primes_sieve1(10**5)

g = int(raw_input().strip())
for a0 in xrange(g):
    n = int(raw_input().strip())
    # your code goes here
    # print pr
    
    n_PRIMES = [i for i in PRIMES if i <= n]
    
    # i = 0
    # while PRIMES[i] <= n:
    #     i += 1
        
    # i -= 1
    
    if len(n_PRIMES)%2 == 0:
        print "Bob"
    else:
        print "Alice"