#include <bits/stdc++.h>
#define forn(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;

const int MAXN = 100000;
int calc[MAXN + 1];

bool isPrime(int x) {
    if(x == 2 || x == 3)
        return true;
    ll d = 2;
    while(d * d <= x && x % d != 0) d++;
    return x % d != 0;
}

int main() {
    //ios_base::sync_with_stdio(false);
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);

    for(int i = 2; i <= MAXN; i++) {
        calc[i] = calc[i - 1];
        if(isPrime(i))
            calc[i]++;
    }
    int t;
    cin >> t;
    while(t--) {
        int n;
        scanf("%d", &n);
        if(calc[n] & 1)
            printf("Alice\n");
        else
            printf("Bob\n");
    }
    return 0;
}