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

int A[100001];

void prime()
{
    for(int i=2;i*i<=100000;i++)
    {
        if(A[i]==0)
        {
            for(int j=i*i;j<=100000;j+=i)
                A[j]=1;
        }
    }
}
int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    prime();
    int n,a;
    
    cin>>n;
    
    

    int count_prime[100002];
    
    for(int i=0;i<n;i++)
        count_prime[i]=0;
    
    for(int i=2;i<=100000;i++)
    {
        if(A[i]==0)
        {
            count_prime[i]=count_prime[i-1]+1;
        }
        else
            count_prime[i]=count_prime[i-1];
    }
    
   // for(int i=0;i<=10;i++)
      // cout<<count_prime[i]<<" ";
    
    
    for(int i=1;i<=n;i++)
    {
        cin>>a;
        if(count_prime[a]%2==1)
            cout<<"Alice"<<endl;
        else
            cout<<"Bob"<<endl;
    }
    
    
    return 0;
}