#!/bin/python

import sys

def getPrimes(n):
    if n == 1:
        return []
    odds = range(3, n+1, 2)
    sieve = set(sum([range(q*q, n+1, q+q) for q in odds],[]))
    return [2] + [p for p in odds if p not in sieve]

def getWinner(n):
    turn = True # Alice = True, Bob = False
    usedNumbers = {}
    primes = getPrimes(n)
    #print n, primes
    for p in primes:
        #print turn, usedNumbers
        if p in usedNumbers:
            continue
        else:
            for num in range(p,n+1,p):
                usedNumbers[num] = True
            turn = not turn
    #print turn, usedNumbers
    if turn:
        return 'Bob'
    else:
        return 'Alice'

g = int(raw_input().strip())
for a0 in xrange(g):
    n = int(raw_input().strip())
    print getWinner(n)