#!/bin/python3

def prime_count(n):
    # count how many primes within n
    if n == 1:
        return 0
    if n == 2:
        return 1
    p = set([2]+ list(range(3,n+1,2)))
    for i in range(3,int(n**0.5)+1,2):
        for j in range(i*2, n+1, i):
            p.discard(j)
    return len(p)

g = int(input().strip())
for a0 in range(g):
    n = int(input().strip())
    # your code goes here
    # find out how many primes in range 1 to n, even, bob wins; odd, alice wins
    pc = prime_count(n)
    if pc%2 == 0:
        print('Bob')
    else:
        print('Alice')