#!/bin/python3

import sys
import math

# find number of primes in range (prime counting function) (x / ln x)
# find number of multiples in range ( int(range_max / number) )
# ^ not important

def soe(n):
    count = 0
    a = [True for i in range(n)]                          # Initialize the primality list
    a[0] = a[1] = False

    for (i, isprime) in enumerate(a):
        if isprime:
            count += 1
            for j in range(i*i, n, i):     # Mark factors non-prime
                a[j] = False
    return count


g = int(input().strip())
for a0 in range(g):
    n = int(input().strip())
    if n == 1:
        print('Bob')
        continue
        
    n_prime = soe(n+1)
    #print(n_prime)
    if n_prime % 2 == 0:
        print('Bob')
    else:
        print('Alice')