#include <bits/stdc++.h>
using namespace std;
using namespace std;


int main(){
    int g,count=0;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        // your code goes here
                bool prime[100000];
    memset(prime, true, sizeof(prime));
 
    for (int p=2; p*p<=n; p++)
    {
       // If prime[p] is not changed, then it is a prime
        if (prime[p] == true)
        {
            count++;
            // Update all multiples of p
            for (int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }
        if(n==1)
            cout<<"Bob"<<endl;
       else if(n==2)
            cout<<"Alice"<<endl;
        else if(count%2==0)
            cout<<"Bob"<<endl;
        else cout<<"Alice"<<endl;
    }
    

    return 0;
}