#!/bin/python

import sys
import math

def count_primes(n):
    if n <= 1:
        return 0
    if n == 2:
        return 1
    n = n+1
    sieve = [True] * n
    for i in xrange(3,int(n**0.5)+1,2):
        if sieve[i]:
            sieve[i*i::2*i]=[False]*((n-i*i-1)/(2*i)+1)
    return 1 + len([i for i in xrange(3,n,2) if sieve[i]])

def prime_count(n):
    if n <= 1:
        return 0
    if n == 2:
        return 1
    count = 0
    for num in range(3,n+1,2):
        if all(num%i!=0 for i in range(2,int(math.sqrt(num))+1)):
            count += 1
    return count+1


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