#!/bin/python

import sys
from math import sqrt; from itertools import count, islice


def isPrime(n):
    return n > 1 and all(n%i for i in islice(count(2), int(sqrt(n)-1)))

def primeexist(n):
    for elem in n:
        if(isPrime(elem)):
            return True
    return False

g = int(raw_input().strip())
for a0 in xrange(g):
    n = int(raw_input().strip())
    a = list(range(1,n+1))
    t = 0
    while(primeexist(a)):
        p = 0
        for elem in a:
            if(isPrime(elem)):
                p = elem
                break
        a.remove(p)
        for elem in a:
            if elem % p == 0:
                a.remove(elem)
        t += 1
    if(t % 2 == 1):
        print("Alice")
    else:
        print("Bob")