#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;
#define SIZE 100005
int primeCount[SIZE];
bool isPrime[SIZE];
void preCompute()
{
    memset(isPrime,true,SIZE);
    for(int i=2;i*i<=SIZE;i++)
    {
        if(isPrime[i])
            for(int j=i*i;j<SIZE;j+=i)
                isPrime[j] = false;
    }
    int count = 0;
    for(int i=2;i<SIZE;i++)
    {
        if(isPrime[i])
            count++;
        primeCount[i] = count;
    }
}
int main(){
    preCompute();
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        if(primeCount[n]%2==0)
            cout<<"Bob"<<endl;
        else cout<<"Alice"<<endl;
    }
    return 0;
}