#!/bin/python

import sys
def primes1(n):
    """ Returns  a list of primes < n """
    sieve = [True] * (n/2)
    if n==2:
        return []
    else:
        for i in xrange(3,int(n**0.5)+1,2):
            if sieve[i/2]:
                  sieve[i*i/2::i] = [False] * ((n-i*i-1)/(2*i)+1)
        return [2] + [2*i+1 for i in xrange(1,n/2) if sieve[i]]
g = int(raw_input().strip())
for a0 in xrange(g):
    n = int(raw_input().strip())
    x=primes1(n+1)
    #print x
    if len(x)%2==1:
        print "Alice"
    else:
        print "Bob"