#!/bin/python3

import sys
import bisect

def primes_gen(n):
    sieve = [True] * n
    sieve[:2] = [False] * 2
    for p in range(n):
        if sieve[p]:
            yield p
            for i in range(p + p, n, p):
                sieve[i] = False

def solve(n, prms):
    i = bisect.bisect_right(prms, n)
    primes = i
    print('n=%d primes=%d' % (n, primes), file = sys.stderr)
    if primes == 0:
        print('Bob')
    elif primes % 2:
        print('Alice')
    else:
        print('Bob')
    
n = pow(10, 5)
prms = list(primes_gen(n + 1))
g = int(input().strip())
for a0 in range(g):
    n = int(input().strip())
    # your code goes here
    solve(n, prms)