from base64 import b64decode
from pickle import loads
from math import sqrt

primes = loads(b64decode(b'gANdcQAoSwJLA0sFSwdLC0sNSxFLE0sXSx1LH0slSylLK0svSzVLO0s9S0NLR0tJS09LU0tZS2FLZUtnS2tLbUtxS39Lg0uJS4tLlUuXS51Lo0unS61Ls0u1S79LwUvFS8dL00vfS+NL5UvpS+9L8Uv7TQEBTQcBTQ0BTQ8BTRUBTRkBTRsBTSUBTTMBTTcBTTkBTT0BTUsBTVEBTVsBTV0BTWEBTWcBTW8BTXUBTXsBTX8BTYUBTY0BTZEBTZkBTaMBTaUBTa8BTbEBTbcBTbsBTcEBTckBTc0BTc8BTdMBTd8BTecBTesBTfMBTfcBTf0BTQkCTQsCTR0CTSMCZS4='))
#print(primes)

def isprime(x):
    if x == 1 or x == 0:
        return False
    sx = int(sqrt(x))
    for p in primes:
        if p > sx:
            return True
        if x % p == 0:
            return False
    return True

Q = [0 for i in range(100001)]
for i in range(1,100001):
    Q[i] = Q[i-1] + 0
    if isprime(i):
        Q[i] += 1
#print(*zip(range(100), map(isprime, range(100))))         
g = int(input().strip())
for a0 in range(g):
    n = int(input().strip())
    if Q[n] % 2 == 0:
        print('Bob')
    else:
        print('Alice')