def rwh_primes(n):
    sieve = [True] * n
    for i in range(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 range(3,n,2) if sieve[i]]
    
primes = set(rwh_primes(100000))

T = int(input())
for t in range(T):
  n = int(input())
  k = sum(map(lambda x: x <=n, primes))
  if k&1:
    print("Alice")
  else:  
    print("Bob")