#!/bin/python3

import sys
import math

def is_number_prime(number):
    if number % 2 == 0 and number > 2: 
        return False
    return all(number % i for i in range(3, int(math.sqrt(number)) + 1, 2))

g = int(input().strip())
for a0 in range(g):
    n = int(input().strip())
   
    nr_of_primes = 0
    for number in range(1, n + 1):
        if(is_number_prime(number)):
            nr_of_primes += 1
        
    nr_of_moves = nr_of_primes % 2
    if(nr_of_moves == 0):
        print("Alice")
    else:
        print("Bob")