#!/bin/python
def SieveOfEratosthenes(n):
    lst=[]

    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
    lis =[]
     
    # Print all prime numbers
    for p in range(2, n):
        if prime[p]:
            lst.append(p)
    return len(lst)
import sys


g = int(raw_input().strip())
for a0 in xrange(g):
    n = int(raw_input().strip())
    # your code goes here
    l=SieveOfEratosthenes(n+1)
    #print lst2
    if(n==1):
        print "Bob"
    elif(n==2):
        print "Alice"
    else:
        #l=len(lst2)
        if(l%2==0):
            print "Bob"
        else:
            print "Alice"