#!/bin/python

import sys

def is_prime(n):
    for i in range(2, int(n**.5)+1):
        if n%i == 0:
            return False
    return True

memo = [2]
n_max = 2
def primes_up_to(n):
    global n_max, memo
    if n < n_max:
        return [i for i in memo if i<=n]
    
    additional = [i for i in range(memo[-1]+1, n+1) if is_prime(i)]
    memo += additional
    n_max = n
    return memo
#print primes_up_to(20)
#print primes_up_to(30)
#print primes_up_to(5)

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