import math
from bisect import bisect_right as br
author="himanshu malhotra"
aa,bb=500,500

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


primes=primes_sieve_best((10**5)+1)

for _ in xrange(input()):
    n=input()
    ind=br(primes,n)
    if (ind-1)%2:
        print "Bob"
    else:
        print "Alice"