#!/bin/python

import sys
import math

n = 100000
n = n+1
R = []
Primes = []
for i in range(n):
    R.append((i, True))
for r in R:
    if r[0] == 0 or r[0] == 1:
        continue
    if (r[1] == True):
        Primes.append(r[0])
        # turn all multiples into False
        for k in range(2, n/r[0]+1):
            if (r[0]*k < n):
                R[r[0]*k] = (R[r[0]*k][0], False)

g = int(raw_input().strip())
for a0 in xrange(g):
    n = int(raw_input().strip())
    # your code goes here
    # the biggest n can be 10^5
    if (n == 1): 
        print "Bob"
        continue
    if (n == 2):
        print "Alice"
        continue
    i = 0
    for p in Primes:
        if (p > n):
            break
        i += 1    
    #print Primes
    if (i % 2 == 0):
        print "Bob"
    else:
        print "Alice"