import sys

def isPrime(n):
	import math
	if n == 1:
		return False
	elif n < 4:
		return True
	elif n & 1 == 0:
		return False
	elif n < 9:
		return True
	elif n %3 == 0:
		return False
	else:
		r = math.floor(math.sqrt(n))
		f = 5
		while f <= r:
			if n % f == 0:
				return False
			if n %(f+2) == 0:
				return False
			f += 6
		return True
    
arr = []
for i in range(2, 10**5 + 1):
    if isPrime(i) is True:
        arr.append(i)

g = int(raw_input().strip())
for a0 in xrange(g):
    n = int(raw_input().strip())
    ans = set(arr)&set(range(n+1))
    num = len(ans)
    
    if num%2 == 0:
        print 'Bob'
    else:
        print 'Alice'