#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int p[100010];
int d[100010];

int main () {
        memset (p, 0, sizeof p);
        memset (d, 0, sizeof d);
        for (int i = 2; i <= 100000; i++) {
                if (!p[i]) {
                        p[++p[0]] = i;
                        d[i] = p[0];
                }
                for (int j = 1; j <= p[0] && p[j] * i <= 100000; j++) {
                        p[p[j] * i] = 1;
                        if (i % p[j] == 0)      break;
                }
        }
        for (int i = 1; i <= 100000; i++) {
                if (d[i] == 0)  d[i] = d[i - 1];
        }
        int t;
        cin >> t;
        while (t--) {
                int n;
                cin >> n;
                if (d[n] % 2 == 0)      cout << "Bob" << endl;
                else    cout << "Alice" << endl;
        }
        return 0;
}