<?php

$from = STDIN;

$primes = [];
$primes = generatePrimes();

$n = intval(trim(fgets($from)));

for ($i=1; $i<=$n; $i++) {
    $val = intval(trim(fgets($from)));
    echo getSol($val) . "\n";
}

function getSol($val)
{
    global $primes;
    if ($val == 1) return 'Bob';

    $smallerPrimes = [];

    // get primes smaller than val
    foreach ($primes as $prime) {
        if ($prime > $val) break;
        $smallerPrimes[] = $prime;
    }

    return (count($smallerPrimes) % 2 == 1) ? 'Alice' : 'Bob';

}

function generatePrimes()
{
    $number = 2;
    $nrs = [];
    while ($number < 10000)
    {
        $div_count=0;
        for ($i=1; $i<=$number; $i++)
        {
            if (($number%$i)==0) {
                $div_count++;
            }
        }
        if ($div_count<3) {
            $nrs[] = $number;
        }
        $number=$number+1;
    }

    return $nrs;

}