def prime(n, primes) :
    arr = [1] * (n+1)
    arr[0] = 0
    arr[1] = 0

    for i in xrange(2, n+1) :
        if arr[i] :
            for j in xrange(i*i, n+1, i) :
                arr[j] = 0

    for i in xrange(n+1) :
        if arr[i] :
            primes.append(i)

def prime_count(n) :
    a = 0
    count = 0

    while n >= primes[a] :
        count = count + 1
        a = a + 1
    return count


t = int(raw_input())
primes = []
prime(1000000, primes)

for i in xrange(t) :
    n = int(raw_input())
    p = prime_count(n)
    if p % 2 == 1 :
        print "Alice"
    else :
        print "Bob"