#!/bin/python

n = 100001
prime = [True for i in range(n+1)]
p=2
while(p * p <= n):
         
    # If prime[p] is not changed, then it is a prime
    if (prime[p] == True):
             
        # Update all multiples of p
        for i in range(p * 2, n+1, p):
            prime[i] = False
    p+=1
    


def SieveOfEratosthenes(con):
     
    # Create a boolean array "prime[0..n]" and initialize
    #  all entries it as true. A value in prime[i] will
    # finally be false if i is Not a prime, else true.
    
    shal = 0

    # Print all prime numbers
    for p in range(2, con):
        if prime[p]:
            shal += 1

    return shal


t = raw_input()
t = int(t)

while t>0:


    n1 = raw_input()
    n1 = int(n1)+1
    t -= 1
    if SieveOfEratosthenes(n1)%2==0:
        print("Bob")
    else:
        print("Alice")