#include <bits/stdc++.h>

using namespace std;

vector < int > q(1001);
vector < int > pr(100001,0);

bool is_prime(int p){
       for(int i = 2; i <= sqrt(p); i++)
           if(p%i==0) return false;
           return true;
}

int main(){
    int g, n = 0;
    cin >> g;
    for(int a0 = 1; a0 <= g; a0++){
        cin >> q[a0];
        n = max(n,q[a0]);
    }
    
    for(int i = 2; i <= n; i++)
    {
            if(is_prime(i)) pr[i] = pr[i-1]+1;
                else pr[i] = pr[i-1];
 
    }
    
    for(int i = 1; i <= g; i++)
    if(pr[q[i]]%2==0) cout << "Bob" << endl;
           else cout << "Alice" << endl;   
    return 0;
}