#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;
    vector<int> primes(100000,1);
    vector<int> num(100001);
    int count = 0;
    num[1] = 0;
    num[0] = 0;
    for(int i=2;i<100001;i++){
        if(primes[i]!=1){
            num[i]=count;
            continue;
        }
        count++;
        num[i]=count;
        for(int j=2*i;j<=100000;j+=i){
            primes[j]=0;
        }
    }
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        if(num[n]%2){
            cout<<"Alice"<<endl;            
        }
        else{
            cout<<"Bob"<<endl;
        }
        // your code goes here
    }
    return 0;
}