#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>
const int MAX=100007+2;

using namespace std;
bool primes[MAX];
map<int,int>A;

void seive(int n)
{
    memset(primes,true,sizeof(primes));
    primes[0]=primes[1]=false;
    for(int i=2;i*i<=n;i++){
        if(primes[i]){
            for(int j=i+i;j<=n;j+=i)
                primes[j]=false;
        }
    }
}

void count(){
    int cnt=0;
    A[1]=0;
    for(int i=2;i<=100000+2;i++){
        if(primes[i]) cnt++;
        A[i]=cnt;
    }
}

int main(){
    seive(100005);
    count();
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        if(!(A[n]%2)) cout<<"Bob"<<endl;
        else cout<<"Alice"<<endl;
    }
    return 0;
}

/*
int main(){
    int n;
    cin >> n;
    vector<int> a(n);
    for(int a_i = 0;a_i < n;a_i++){
       cin >> a[a_i];
    }
    sort(a.begin(),a.end());
    int cnt=0;
    int maxi=0;
    int ans=0;
    int i=0,j=1;
    for(i,j;i<=j and j<a.size();){
        if(i==j){
            j++;
            continue;
        }
        if(a[j]-a[i]<=1){
            j++;
        }
        else{
            ans=max(ans,j-i);
            i++;
        }
    }
    cout<<max(ans,j-i)<<endl;
    return 0;
}
*/