#!/bin/python

import sys
from math import log

def primes_sieve(limit):
    limitn = limit+1
    not_prime = set()
    primes = []

    for i in range(2, limitn):
        if i in not_prime:
            continue

        for f in range(i*2, limitn, i):
            not_prime.add(f)

        primes.append(i)

    return primes

g = int(raw_input().strip())
for a0 in xrange(g):
    n = int(raw_input().strip())
    primes = primes_sieve(n)
    if len(primes) % 2 == 1:
        print 'Alice'
    else:
        print 'Bob'