#include <bits/stdc++.h>

using namespace std;


int main(){
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n,i,k,j,m=0;
        cin >> n;
        // your code goes here
     bool prime[n+1];
    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)
        {
            // Update all multiples of p
            for (int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }
 
    // Print all prime numbers
    for (int p=2; p<=n; p++)
       if (prime[p])
          m++;

        if(n==1||(m%2==0))
            cout<<"Bob\n";
        else
        cout<<"Alice\n";

    }
    return 0;
}