#!/bin/python

import sys


def prime_sieve(n):
    sieve = [True] * (n/2)
    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())
    count=prime_sieve(n+1)
    #print count
    if n==1:
        print "Bob"
    elif len(count)%2==0:
        print "Bob"
    else:
        print "Alice"