#!/bin/python3

import sys
import random
num_trials =  4# number of bases to test
 
def is_prime(n):
    if n<2:
        return False
    else:
        assert n >= 2
        # special case 2
        if n == 2:
            return True
        # ensure n is odd
        if n % 2 == 0:
            return False
        # write n-1 as 2**s * d
        # repeatedly try to divide n-1 by 2
        s = 0
        d = n-1
        while True:
            quotient, remainder = divmod(d, 2)
            if remainder == 1:
                break
            s += 1
            d = quotient
        assert(2**s * d == n-1)
 
        # test the base a to see whether it is a witness for the compositeness of n
        def try_composite(a):
            if pow(a, d, n) == 1:
                return False
            for i in range(s):
                if pow(a, 2**i * d, n) == n-1:
                    return False
            return True # n is definitely composite
 
        for i in range(num_trials):
            a = random.randrange(2, n)
            if try_composite(a):
                return False
 
        return True

def primes_sieve1(limit):
    limitn = limit+1
    primes = dict()
    for i in range(2, limitn): primes[i] = True

    for i in primes:
        factors = range(i,limitn, i)
        for f in factors[1:]:
            primes[f] = False
    return [i for i in primes if primes[i]==True]

g = int(input().strip())
for a0 in range(g):
    n = int(input().strip())
    # your code goes here

    if len(primes_sieve1(n))%2 == 0 :
        print ("Bob")
    else:
        print ("Alice")