#!/bin/python

import sys
def primes2(n):
    n, correction = n-n%6+6, 2-(n%6>1)
    sieve = [True] * (n/3)
    for i in xrange(1,int(n**0.5)/3+1):
      if sieve[i]:
        k=3*i+1|1
        sieve[      k*k/3      ::2*k] = [False] * ((n/6-k*k/6-1)/k+1)
        sieve[k*(k-2*(i&1)+4)/3::2*k] = [False] * ((n/6-k*(k-2*(i&1)+4)/6-1)/k+1)
    return [2,3] + [3*i+1|1 for i in xrange(1,n/3-correction) if sieve[i]]
g = int(raw_input().strip())
for a0 in xrange(g):
    n = int(raw_input().strip())
    my=len(primes2(n+1))
    if(n<=1):
        print "Bob"
    elif(n<3):
        print "Alice"
    elif(n<4):
        print "Bob"
    elif(my%2==0):
        print "Bob"
    else:
        print "Alice"