#include <bits/stdc++.h>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

#define MAX 100010

int primes[MAX];

bool isprime(long long n)
{
    if(n == 2) return true;
    for(long long i = 2; i * i <= n; i++)
        if(n % i == 0)
            return false;
    return true;
}
int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    for(int i = 2; i < MAX; i++)
        primes[i] = primes[i-1] + isprime(i);
    int test, n;
    cin >> test;
    while(test--)
    {
        cin >> n;
        if(primes[n] % 2)
            cout << "Alice\n";
        else
            cout << "Bob\n";
    }
    return 0;
}