#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 pre[100010];
int p[100010];

void sieve() {
    const int maxn = 100000;
    for(int i = 4; i <= maxn; i += 2) {
        p[i] = 1;        
    }
    for(int i = 3; i * i <= maxn; i += 2) {
        if(p[i] == 1) continue;
        for(int j = i*i; j <= maxn; j += (i << 1)) {
            p[j] = 1;
        }
    }
    for(int i = 2; i <= maxn; i++) {
        pre[i] = pre[i - 1];
        if(p[i] == 0) pre[i]++;
    }
}

int main(){
    sieve();
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        if(pre[n] & 1) cout << "Alice" << endl;
        else cout << "Bob" << endl;
    }
    return 0;
}