#!/bin/python

import sys
import math

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

def find_prime(n):
    lst = list()
    if n >= 2:
        lst.append(2)
    if n >= 3:
        lst.append(3)
    
    start = 6
    i = 1
    
    while start-1 <= n:
        if is_prime(start-1):
            lst.append(start-1)
        if start + 1 <= n and is_prime(start+1):
            lst.append(start + 1)
        i += 1
        start = start*i
        
    return lst


g = int(raw_input().strip())
for a0 in xrange(g):
    n = int(raw_input().strip())
    l = find_prime(n)
    #print l
    if len(l) % 2 == 0:
        print "Bob"
    else:
        print "Alice"
    # your code goes here