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

bool prime[100001];
int c[100001];

void precompute()
{
    int pre=0;
    memset(prime, true, sizeof(prime));
    memset(c,0, sizeof(c));
    for (int p=2; p<=100001; p++)
    {
        // If prime[p] is not changed, then it is a prime
        if (prime[p] == true)
        {   pre=pre+1;
            c[p]=pre;
            // Update all multiples of p
      for (int i=p*2; i<=100001; i += p)
                prime[i] = false;
        }
        else  c[p]=pre;
    }
 }

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int n,g;
    precompute();

    cin>>g;
    while(g--){
    cin>>n;
   if(c[n]%2==0)cout<<"Bob"<<endl;
    else if(c[n]%2==1)cout<<"Alice"<<endl;
    }
    return 0;
}