#!/bin/python3

import sys

def find_primes():
    arr = [2]
    for i in range(3,1000000):
        stance = True
        for j in range(2,int(i**0.5) + 1):
            if i % j == 0:
                stance = False
                break
        if stance:
            arr.append(i)
    return arr
g = int(input().strip())
arr = find_primes()
for a0 in range(g):
    n = int(input().strip())
    index = 0
    while arr[index] <= n and index < len(arr):
        index += 1
    if (index) % 2 == 1:
        print("Alice")
    else:
        print("Bob")