#!/bin/python

import sys
def isPrime(n):
    for i in range(2,int(n**0.5)+1):
        if n%i==0:
            return False

    return True
def countprime(n):
    count=0
    for i in range(2,n+1):
        if(isPrime(i)==True):
            count+=1
    return count    
g = int(raw_input().strip())
for a0 in xrange(g):
    n = int(raw_input().strip())
    # your code goes here
    if countprime(n)%2==0:
        print "Alice"
    else:
        print "Bob"