#!/bin/python


import sys

def gen_primes(n):
	primes = [True for x in xrange(n+1)]

	primes[0] = False
	primes[1] = False
	
	p = 2
	while p*p <= n:
		if primes[p] == True:
			for i in range(2*p, n+1, p):
				primes[i] = False
		p += 1
	return primes

def get_winner(n, L):
	i = 1
	count = 0
	
	while (i <= n):
		if L[i]:
			count += 1
		i += 1

	if count%2 == 0:
		print "Bob"
	else:
		print "Alice"

if __name__ == "__main__":
	L = gen_primes(100000)
	# print len(L)
	g = int(raw_input().strip())
	for i in xrange(g):
		n = int(raw_input().strip())
		get_winner(n, L)