#!/bin/python

import sys
def eratostheres_primes(n,sPrimes):
    primes = list(sPrimes)
    visited = set(primes)
    
    for x in primes:
        i = primes[-1]/x + 1
        while x*i <= n:
            visited.add(x*i)
            i+=1
    #print sPrimes
    for x in xrange(primes[-1]+1,n+1):
        if x not in visited:
            primes.append(x)
            i = 1
            while x*i <= n:
                visited.add(x*i)
                i+=1
    return primes

def eratostheres_primes2(n):
    primes = []
    visited = set()
    for x in range(2,n+1):
        if x not in visited:
            primes.append(x)
            i = 1
            while x*i <= n:
                visited.add(x*i)
                i+=1
    return primes

def solve(n,sPrimes):
    if len(sPrimes) == 0:
        return eratostheres_primes2(n)
    else:
        return eratostheres_primes(n,sPrimes)

def binary_search(arr,x):
    pass

g = int(raw_input().strip())
primes = []
maxN = 0
for a0 in xrange(g):
    n = int(raw_input().strip())
    maxN = max(maxN,n)
    primesCount = 0
    if maxN > n:
        for x in primes:
            if x > n:
                break
            primesCount+=1
    else:
        primes = solve(n,primes)
        primesCount = len(primes)
    
    if primesCount % 2 == 0:
        print 'Bob'
    else:
        print 'Alice'
    #print primes