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