#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 main(){
    int g;
    cin >> g;
    int i,j,x,c;
    vector<bool>v(100001,true);
        v[1]=false;v[0]=false;
        for(i=4;i<=100000;i+=2)
            v[i]=false;
        for(i=3;i<100000;i+=2)
            {
            if(v[i]==true)
                {
                for(j=2*i;j<100000;j+=i)
                    v[j]=false;
            }
        }
    
    for(int a0 = 0; a0 < g; a0++){
        
        cin>>x;
        c=0;
        if(x==1)
        {cout<<"Bob"<<endl;continue;}
        else if(x==2)
        {cout<<"Alice"<<endl;continue;}
        for(i=2;i<=x;i++)
            {
            if(v[i]==true)
            {c++;}
        }
        //cout<<endl<<c<<endl;
        if(c%2)
            cout<<"Alice"<<endl;
        else
            cout<<"Bob"<<endl;
    }
    return 0;
}