#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;

const int maxn = 1000*100 + 100;
int main(){
    int g;
    cin >> g;
    
    vector<int> primes;
    vector<int> c(maxn,0);
    c[2] = 1;
    primes.push_back(2);
    for(int i=3;i<maxn;i++){
        bool isP = true;
        
        for(int j=0; j<primes.size() && primes[j]*primes[j] <= i;j++)
            if(i % primes[j] == 0)
            {
                isP = false;
                break;
            }
        
        c[i] = c[i-1];
        if(isP){
            primes.push_back(i);
            c[i]++;
        }
        
    }
    
    
    
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        // your code goes here
        if(c[n] % 2 == 0){
            cout << "Bob" << endl;
           
        }
        else
             cout << "Alice" << endl;
        
    }
    return 0;
}