#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;
int countar[200005];
bool prime[200005];
void seive(int n)
{
   memset(prime,true,sizeof(prime));
     prime[1]=false;
    for(int i=2;i*i<=n;i++)
     {
        if(prime[i])
            {
             for(int j=2*i;j<n;j=j+i)
                {
                     prime[j]=false;           
                }
        }
    }
    int count1=0;
    for(int j=1;j<n;j++)
    {
       if(prime[j])
       {
          count1++;    
       }
        countar[j]=count1; 
    }
}

int main(){
    int g;
    cin >> g;
    seive(100005);
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
          if(countar[n]%2==1)
          {
            cout<<"Alice"<<endl;  
          }
         else
          {
             cout<<"Bob"<<endl;   
         }
        // your code goes here
    }
 
    return 0;
}