from sys import stdin

def primes_below(n):
    if n < 2:
        return []
    elif n == 2:
        return [2]
    n = n + 1

    sieve = [True] * (n/2)
    for i in xrange(3,int(n**0.5)+1,2):
        if sieve[i/2]:
            sieve[i*i/2::i] = [False] * ((n-i*i-1)/(2*i)+1)
    return [2] + [2*i+1 for i in xrange(1,n/2) if sieve[i]]


stdin.readline()
for nn in stdin.read().splitlines():
    plen = len(primes_below(int(nn)))
    print "Alice" if plen % 2 != 0 else "Bob"