#!/bin/python

import sys
import math

prime_memo = {1:0}

def is_prime(x):
    if x == 1:
        return False
    for i in range(2,int(math.sqrt(x))+1):
        if x % i == 0:
            return False
    return True


g = int(raw_input().strip())
for a0 in xrange(g):
    n = int(raw_input().strip())
    largest_so_far = max([x for x in prime_memo.keys() if x <= n])
    n_primes = prime_memo[largest_so_far]
    for i in range(largest_so_far+1, n+1):
        if is_prime(i):
            n_primes += 1
    prime_memo[n] = n_primes
    if n_primes % 2 == 0:
        print 'Bob'
    else:
        print 'Alice'