def prime_sieve(x):
    sieve = list(range(x + 1))
    for i in sieve:
        if i > 1:
            for j in range(i + i, len(sieve), i):
                sieve[j] = 0
    return [1 if i != 0 else 0 for i in sieve]

primes = prime_sieve(10**5)

g = int(input())
for _ in range(g):
    n = int(input())
    print('Bob' if sum(primes[:n+1]) % 2 else 'Alice')