#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 set_bit(unsigned char * p_ar,unsigned int offset,unsigned char uc_bit)
{
    unsigned int  i_byte=offset/8;
    unsigned char  i_bit_mask=1<<(7-offset%8);
    if(uc_bit) p_ar[i_byte]=p_ar[i_byte]|i_bit_mask;
    else p_ar[i_byte]=p_ar[i_byte]&(i_bit_mask^0xff);
    return 0;
}

int get_bit(unsigned char * p_ar,unsigned int offset)
{
    unsigned int  i_byte=offset/8;
    unsigned char  i_bit_mask=1<<(7-offset%8);
    return ((p_ar[i_byte]&i_bit_mask)==0)?0:1;
}

int main(){
    int g;
    cin >> g;
    vector<int> n_(g);
    int max_=0;
    for(int a0 = 0; a0 < g; a0++){
        cin >> n_[a0];
        max_=max(n_[a0],max_);
        // your code goes here
    }

    int sq_m = sqrt(max_)+1;
    int l_bit=(max_+1)/8+1;
    unsigned char * bit_p1=new unsigned char[l_bit];
    memset(bit_p1,0xff,sizeof(unsigned char)*l_bit);
//    set_bit(bit_p1,0,0);
//    set_bit(bit_p1,1,0);
//     cout<<"sqm="<<sq_m<<" ";
    for(int i = 2;i<sq_m;i++){
//        cout<<"i="<<i<<"\n";
        if(get_bit(bit_p1,i)==1){
              for(int ii=i*i;ii<max_+1;ii+=i) set_bit(bit_p1,ii,0);
        }
    }
    int p_count;
    for(int a0 = 0; a0 < g; a0++){
        p_count=0;
        for(int i =2;i<=n_[a0];i++){
          if(get_bit(bit_p1,i)==1)
          {
            p_count++;   
//            cout<<i<<" ";
              
          }
        }
//        cout<<"c="<<p_count<<" ";
        if(p_count%2==0) 
            cout<<"Bob"<<"\n";
        else
            cout<<"Alice"<<"\n";
    }
    return 0;
}