#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 Maxn = 100005;

int pr[Maxn];

int main(){
    fill(pr + 2, pr + Maxn, 1);
    for (int i = 2; i < Maxn; i++) if (pr[i])
        for (int j = i + i; j < Maxn; j += i) pr[j] = 0;
    for (int i = 1; i < Maxn; i++)
        pr[i] += pr[i - 1];
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        if (pr[n] % 2) printf("Alice\n");
        else printf("Bob\n");
    }
    return 0;
}