#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 nmax = 1e5 + 5;
int lp[nmax];
vector<int> p;
int dp[nmax];
int main(){
    for(int i = 2; i < nmax; ++i){
        if (!lp[i]){
            lp[i] = i;
            p.push_back(i);
        }
        for(int j = 0; j < p.size() && p[j] <= lp[i] && p[j] * i < nmax; ++j){
            lp[i * p[j]] = p[j]; 
        }
    }
    int j = 0;
    for(int i = 1; i < nmax; ++i){
        dp[i] = dp[i - 1];
        if (j < p.size()){
            if (i == p[j]){
                dp[i]++;
                j++;
            }
        }
    }
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        cout << (dp[n] % 2 == 0? "Bob": "Alice") << '\n';
        // your code goes here
    }
    return 0;
}