#!/bin/python3

import sys

def primes(n):
    if n > 2:
        sieve = [True] * n
        for i in range(3,int(n**0.5)+1,2):
            if sieve[i]:
                sieve[i*i::2*i]=[False]*int((n-i*i-1)/(2*i)+1)
        return [2] + [i for i in range(3,n,2) if sieve[i]]
    else:
        return []

g = int(input().strip())
for a0 in range(g):
    n = int(input().strip())
    m = len(primes(n+1))
    if m%2 == 0:
        print("Bob")
    else:
        print("Alice")