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

vector<int> sieveNim(int n) {
    vector<int> nums;
    vector<int> tb(n+1);
    for (int i = 2; i <= n; ++i) {
        if (tb[i] != 0) continue;
        nums.push_back(i);
        for (int j = 2*i; j <= n; j += i) {
            ++tb[j];
        }
    }
    
    return nums;
}

int main(){
    int g;
    cin >> g;
    
    vector<int> nums = sieveNim(100000);
    
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        auto it = lower_bound(nums.begin(), nums.end(), n);
        
        int k = it - nums.begin();
        if (*it == n) {
            ++k;
        }
        
        if (k % 2 == 1) {
            cout << "Alice" << endl;
        } else {
            cout << "Bob" << endl;
        }
    }
    return 0;
}