#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;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        vector<bool> pr;
        pr.assign(n + 5, 1);
        int nrP = 0;
        for(int i = 2; i <= n; i++) {
            if(pr[i]) {
                nrP++;
                for(int j = i * 2; j <= n; j += i)
                    pr[j] = 0;
            }
        }
        if(nrP % 2)
            cout << "Alice\n";
        else
            cout << "Bob\n";
        
        
        
    }
    return 0;
}