#!/bin/python3

import sys

def getPrimeList(n):
    size = n//2
    sieve = [1]*size
    limit = int(n**0.5)
    for i in range(1,limit):
        if sieve[i]:
            val = 2*i+1
            tmp = ((size-1) - i)//val
            sieve[i+val::val] = [0]*tmp
    return [2] + [i*2+1 for i, v in enumerate(sieve) if v and i>0]



g = int(input())
n_set = [int(input()) for _ in range(g)]
for i in n_set:
    prime_set = getPrimeList(i+1)
    if i==1:
        print("Bob")
    elif i==2:
        print("Alice")
    else:
        l = len(prime_set)
        if l%2==0:
            print("Bob")
        else:
            print("Alice")