#!/bin/python

import sys
def sieve_for_primes_to(n):
    size = n//2
    sieve = [1]*size
    limit = int(n**0.5)
    for i in range(1,limit):
        if sieve[i]:
            val = 2*i+1
            tmp = ((size-1) - i)//val 
            sieve[i+val::val] = [0]*tmp
    return [2] + [i*2+1 for i, v in enumerate(sieve) if v and i>0]
A=[]
g = int(raw_input().strip())
for a0 in xrange(g):
    n = int(raw_input().strip())
    A.append(n)
MP=sieve_for_primes_to(max(A)+1)
for x in A:
    c=0
    for t in MP:
        if t<=x:
            c+=1
        else:
            break
    #print x, c
    if c%2:
        print "Alice"
        
    else:
        print "Bob"