#!/bin/python3

import sys
import math


def is_prime(n):
    if n % 2 == 0 and n > 2 or n == 1:
        return False
    return all(n % i for i in range(3, int(math.sqrt(n)) + 1, 2))


def find_prime(s):
    for num in s:
        if is_prime(num):
            return num
    return None


g = int(input().strip())
for a0 in range(g):
    n = int(input().strip())
    move = 0
    s = list(range(1, n + 1))
    first_prime = find_prime(s)
    while first_prime is not None:
        # Remove multiples
        s.remove(first_prime)
        s = [num for num in s if num % first_prime != 0]
        move += 1
        first_prime = find_prime(s)
    print("Bob" if move % 2 == 0 else "Alice")