#include <bits/stdc++.h>

#define forn(i, n) for (int i = 0; i < n; i++)
#define re return
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) (int)a.size()
#define x first
#define y second
#define point pair <int, int>
#define re return
#define se second
#define fi first
#define mp(a, b) make_pair(a, b)
#define mp1(a, b, c, d) make_pair(mp(a, b), mp(c, d))
using namespace std;
typedef long long ll;

int ans, n, a[2 * 100000];

int main() {
    iostream::sync_with_stdio(0);
    //freopen("a.in", "r", stdin);
    cin >> n;
    a[0] = a[1] = 1;
    forn (i, 100001) {
        if (a[i] == 0) {
            for (int j = i + i; j <= 100000; j += i)
                a[j] = 1;
        }
        if (i) a[i] += a[i - 1];
    }
    forn (i, n) {
        cin >> ans;
        if ((ans - a[ans]) % 2 == 0)
            cout << "Alice\n";
        else
            cout << "Bob\n";
    }
    return 0;
}