#include <bits/stdc++.h>

using namespace std;


int fn(int n)
{
    bool prime[n+1];
    for(int i=0;i<n+1;i++)prime[i]=true;
    for (int p=2; p*p<=n; p++)
    {
        if (prime[p] == true)
        {
            for (int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }
 
    int ret=0;
    for (int p=2; p<=n; p++)
       if (prime[p])
          ret++;
        
    return ret;
}
 
int main() {
    int tc;
    cin>>tc;
    while(tc>0){
        int n;
        cin>>n;
        int g=fn(n);
        if(g%2==1)cout<<"Alice\n";
        else cout<<"Bob\n";
        tc--;
    }
    return 0;
}