#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(){
    vector<int> primeCount(100001,0);
    vector<bool> primeBool(100001, true);
    for (int i=2; i<100001; i++){
        if (primeBool[i]==true){
            primeCount[i]=primeCount[i-1]+1;
            for (int j=i; j<100001; j+=i){
                primeBool[j]=false;
            }
        }
        else {
            primeCount[i]=primeCount[i-1];
        }
    }
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        if (primeCount[n] % 2 == 1){
            cout<<"Alice"<<endl;
        }
        else {
            cout<<"Bob"<<endl;
        }
        // your code goes here
    }
    /*
    for (int i=1; i<30; i++){
        cout<<i<<" ";
    }
    cout<<endl;
    for (int i=1; i<30; i++){
        cout<<primeBool[i]<<" ";
    }
    cout<<endl;
    for (int i=1; i<30; i++){
        cout<<primeCount[i]<<" ";
    }
    cout<<endl;
    */
    return 0;
}