#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;
    set<int> primes;
    primes.insert(2);
    vector<int> prto(100001);
    for (auto i = 3; i<100000; i++) {
        bool isprime = true;
        for (auto x:primes) {
            if (x>sqrt(i)) break; 
            else if (i%x == 0) {
                isprime = false;
                break;
            }
        } 
        if (isprime) primes.insert(i); 
    }
    prto[0] = 0;
    for (auto i = 1; i<100001; i++) {
        if (primes.find(i) != primes.end()) {
            prto[i]= prto[i-1]+1;
        } else {
            prto[i]=prto[i-1];
        }
    }
    for (auto i = 0; i<500; i++) {
       // cerr<<i<<":"<<prto[i]<<endl;
    }
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        // your code goes here
        if (prto[n]%2==0)cout<<"Bob\n";
        else cout<<"Alice\n";
    }
    return 0;
}