#!/bin/python3

import sys


def primes1(n):
    """ Returns  a list of primes < n """
    sieve = [True] * (n//2)
    for i in range(3,int(n**0.5)+1,2):
        if sieve[i//2]:
            sieve[i*i//2::i] = [False] * ((n-i*i-1)//(2*i)+1)
    return [2] + [2*i+1 for i in range(1,n//2) if sieve[i]]


g = int(input().strip())
nvals = []
for _ in range(g):
    nvals.append(int(input()))
maxval = max(nvals) + 1
primes = set(primes1(maxval))
# print(primes)
ans = [False,False]
for i in range(2, maxval):
    ans.append(ans[-1])
    if i in primes:
        ans[-1] = (ans[-1] + 1) % 2
for n in nvals:
    print("Alice" if ans[n] % 2 == 1 else "Bob")