#!/bin/python

import sys

def SieveOfEratosthenes(n):
    global prime
    p=2
    while(p * p <= n):
        if (prime[p] == True):
            for i in range(p * 2, n+1, p):
                prime[i] = False
        p+=1

g = int(raw_input().strip())
res = []
max_n = 1
for a0 in xrange(g):
    n = int(raw_input().strip())
    if max_n < n:
        max_n = n
    res.append(n)
prime = [True for i in range(max_n+1)]
prime[0] = False
prime[1] = False
SieveOfEratosthenes(max_n)
#print 'prime', prime
sums = []
count = 0
for p in range(max_n+1):
    if prime[p] == True:
        count+=1
    sums.append(count)
#print 'sums', sums
for i in range(g):
    if sums[res[i]]%2!=0:
        res[i] = 'Alice'
    else:
        res[i] = 'Bob'
print '\n'.join(res)