#!/bin/python

import sys,math

prime_list=[]

def calc_prime(n,max_n):

    if n==1:

        return [],max(1,max_n)
    if n>max_n:
        start_n=1 if max_n is None else max_n
        for x in xrange(start_n+1,n+1):

            for i in prime_list:
                if i>math.sqrt(x):
                    prime_list.append(x)
                    break
                if x%i==0:
                    break
            else:
                prime_list.append(x)
        max_n=n
    elif n<max_n:
        tmp_prime=[]
        for p in prime_list:
            if p>n:
                break
            tmp_prime.append(p)
        return tmp_prime,max_n
    #print prime_list,max_n
    return prime_list,max_n
            

g = int(raw_input().strip())
max_n=None
for a0 in xrange(g):
    n = int(raw_input().strip())
    # your code goes here
    primes,max_n=calc_prime(n,max_n)
    if len(primes)%2==0:
        print "Bob"
    else:
        print "Alice"