#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
const int MAX = 1e5+5;
int prime[MAX], cnt[MAX];
 
void seive(int n)
{
  for(int i=2;i<=n;i++) prime[i]=1;
 
   for(int i=2;i*i<=n;i++)
     {
     if(prime[i])        
             {
                 for(int k=2;k*i<=n;k++)
                 prime[k*i]=0;        
             }
     }
    
    for(int i=2;i<=n;i++){
        cnt[i] = cnt[i-1] + prime[i];
    }
}


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int g;
    cin >> g;
    seive(MAX-5);
    while(g--){
    int n;
    cin >> n;
    if(cnt[n]%2 == 0){
        cout <<"Bob\n";
    }
        else{
            cout <<"Alice\n";
        }
    }
    return 0;
}