#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+10;
bool prime[N];
int cnt[N];
int main(){
    fill(prime+2,prime+N,true);
    for(int i = 2; i < N; ++i){
        if(prime[i])
            for(int j = 2*i; j < N; j += i)
                prime[j] = false;
        cnt[i] = prime[i] + cnt[i-1];
    }
    int g;
    cin >> g;
    while(g--){
        int n;
        cin >> n;
        if(cnt[n]%2==0)
            puts("Bob");
        else
            puts("Alice");
    }
}