#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int LIM=100000;
int rt=sqrt(100000)+1;

int main() 
{
    vector<bool> isprime(LIM+1, true);
    isprime[0]=false;
    isprime[1]=false;
    for (int i=2; i<=rt; i++)
        if (isprime[i])
            for (int j=i*i; j<=LIM; j+=i)
                isprime[j]=false;
   
    vector<int> pi(LIM+1,0);
    for (int i=1; i<=LIM; i++)
        pi[i]=pi[i-1]+isprime[i];
   
    int t; cin>>t;
    while (t--)
    {
        int n;
        cin>>n;
        cout<< (pi[n]%2 ? "Alice" : "Bob")<<endl;
    }
     
        
}