from math import floor, sqrt, ceil

def isPrime(n):
    if n in (0,1):
        return False
    elif n ==2:
        return True
    else:
        for i in range(2,ceil(sqrt(n))+1):
            if n%i == 0:
                return False
    return True

t = int(input())


for i in range(t):
    n = int(input())
    count = 0
    for i in range(n+1):
        if isPrime(i):
            count+=1
            
    if count%2==0:
        print('Bob')
    else:
        print('Alice')