#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 g, n;
vector<int> p;

string answer(int n) {
    vector<int>::iterator it = upper_bound(p.begin(), p.end(), n);
    int count = (int)(it-p.begin());
    if(count % 2 == 0) return "Bob";
    else return "Alice";
}

int main(){
    int m = 100001;
    vector<bool> s(m, true);
    s[0] = s[1] = false;
    for(int i = 4; i < m; i+=2) s[i] = false;
    for(int i = 3; i <= m/2; i+=2) {
        if(s[i] == false) continue;
        for(int j = 2; j*i < m; ++j) s[j*i] = false;
    }
    for(int i = 0; i < m; ++i)
        if(s[i])
            p.push_back(i);
    
    cin >> g;
    for(int game = 0; game < g; ++game) {
        cin >> n;
        cout << answer(n) << endl;
    }
    return 0;
}