#!/bin/python3
import math
import sys

def find_primes(number):
    count = 0
    for i in range(2,number+1):
        isprime = 1
        for k in range(2,int(math.sqrt(i))+1):
            if(i % k == 0):
                isprime = 0
                break
        if isprime == 1:
            count += 1
    return count
    


g = int(input().strip())
for a0 in range(g):
    n = int(input().strip())
    prime_c = find_primes(n)
    if prime_c % 2 == 0:
        print("Bob")
    else:
        print("Alice")