#!/bin/python

def sieve(n):
    # Return all primes <= n
    s = list(range(n+1))
    s[1] = 0
    sqrtn = int(round(n**0.5))
    for i in xrange(sqrtn+1):
        if s[i]:
            s[i*i: n+1: i] = [0]*len(xrange(i*i, n+1, i))
    return filter(None, s)

primes = sieve(10**4)

g = int(raw_input().strip())
for a0 in xrange(g):
    n = int(raw_input().strip())
    moves = 0
    i = 1
    a = range(1, n+1)
    while i <= n:
        if i in primes:
            a = [x for x in a if x%i != 0]
            moves+=1
        i+=1
    if moves%2 == 1: print 'Alice'
    else: print 'Bob'