def get_num_primes(n, primes):
    if primes[n] == -1:
        sieve = [True] * (n + 1)
        sieve[0] = sieve[1] = False

        for i in xrange(2, int(n ** 0.5) + 1):
            if sieve[i]:
                for j in xrange(i ** 2, n + 1, i):
                    sieve[j] = False

        primes[n] = sum(sieve) 
        
    return primes[n]        

g = int(raw_input().strip())
primes = [-1] * 100001
for a0 in xrange(g):
    n = int(raw_input().strip())
    num_primes = get_num_primes(n, primes)
    print "Bob" if num_primes % 2 == 0 else "Alice"