#!/bin/python3

import sys

def is_prime(n):
    for i in range(2, n):
        if n % i == 0:
            return False
    return True

def prime_list(n):
    prime_list = []
    for num in range(1, n+1):
        if is_prime(num):
            prime_list.append(num)
    return prime_list

def remove_multiples(multi, list):
    copy_list = list[:]
    for aa in list:
        if aa % multi == 0:
            copy_list.remove(aa)
    return copy_list
    

g = int(input().strip())
for a0 in range(g):
    n = int(input().strip())
    # your code goes here
    
    s = [i for i in range(1, n+1)]
    player = 0
    # Remove the min prime number (higher number of multiplier)
    primes = prime_list(n)
    while len(primes) != 0:
        # Player pick a prime number
        min_prime = min(primes)
        s.remove(min_prime)
        primes.remove(min_prime)
        # Remove multiples
        remove_multiples(min_prime, s)
        # Change player
        player = abs(player - 1)
    if player == 0:
        print("Alice")
    else:
        print("Bob")