#!/bin/python

import sys
def primes1(n):
    """ Returns  a list of primes < n """
    sieve = [True] * (n/2)
    for i in xrange(3,int(n**0.5)+1,2):
        if sieve[i/2]:
            sieve[i*i/2::i] = [False] * ((n-i*i-1)/(2*i)+1)
    return [2] + [2*i+1 for i in xrange(1,n/2) if sieve[i]]
d = {}
z = 1
for i in primes1(100000):
    d[i] = z
    z += 1

g = int(raw_input().strip())
for a0 in xrange(g):
    n = int(raw_input().strip())
    # your code goes here
    if n in d:
        moves = d[n]
    else:
        x = n
        y = n
        while x not in d and y not in d:
            x-=1
            y+=1
        if x in d:
            moves = d[x]
        else:
            moves = d[y]-1
    print "Alice" if moves %2 == 1 else "Bob"