#!/bin/python

import sys

def sieve(n):
    "Return all primes <= n."
    np1 = n + 1
    s = (range(np1)) # leave off `list()` in Python 2
    s[1] = 0
    sqrtn = int(round(n**0.5))
    for i in xrange(2, sqrtn + 1): 
        if s[i]:
            s[i*i: np1: i] = [0] * len(xrange(i*i, np1, i))
    return filter(None, s)

g = int(raw_input().strip())
for a0 in xrange(g):
    n = int(raw_input().strip())
    t = sieve(n)
    prime_count = len(t)
    if prime_count % 2 == 0:
        print "Bob"
    else:
        print "Alice"