#!/bin/python

import sys
def primeslessthan(n):
    if n==1:
        return []

    nums =[1]*n
    listofprimes = []
    nums[0] =nums[1]=0
    i=2
    while i*i<n:
        if nums[i] is 1:
            listofprimes.append(i)
            ti = i*i
            a = n - ti
            b = i
            nm = a/b +int(a%b>0)
            nums[ti::i] = [0]*nm
        i = i+1
    for b in xrange(i,n):
        if nums[b] is 1:
            listofprimes.append(b)

    return listofprimes

g = int(raw_input().strip())
for a0 in xrange(g):
    n = int(raw_input().strip())
    # your code goes here
    if len(primeslessthan(n+1))%2==1:
        print "Alice"
    else:
        print "Bob"