p=[]
import math

def prime(x):
    i=2
    while i<=(int)(math.sqrt(x)):
        if x%i==0:
            return 0
        i+=1
    return 1
i=0
while i<=100000:
    if prime(i):
        p+=[i]
    i+=1

    
    

def g(x,l,r):
    global p
    m=(l+r)/2
    if p[m]==x:
        return m+1
    if p[m]>x and m-1>=0 and p[m-1]<x or p[m]>x and m==l:
        return m-1+1
    if p[m]<x and m+1<len(p) and p[m+1]>x or p[m]<x and m==r:
        return m+1
    if p[m]>x:
        return g(x,l,m-1)
    else:
        return g(x,m+1,r)
    
        
ga=int(raw_input())
s=[]
for i in range(ga):
    n=int(raw_input())
    x=g(n,0,len(p)-1)
    if x%2==0:
        s.append("Bob")
    else:
        s.append("Alice")
for i in s:
    print i