#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
#define MAXN 123456
int till[MAXN] = {0},p[MAXN]={0};

void prime(){
    for(int i=2;i<1234;i++){
        if(p[i]==0)
        for(int j=i*2;j<MAXN;j+=i){
            p[j] = 1;
        }
    }
    //for(int i=2;i<20;i++) cout << p[i] << " ";cout << endl;
    for(int i=1;i<MAXN;i++){
        if(p[i]==0) till[i] = till[i-1]+1;
        else till[i] = till[i-1];
    }
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */ 
    int g,n;cin >> g;
    prime();
    while(g--){
        cin >> n;
       if(till[n]%2) cout << "Bob" << endl;
        else cout << "Alice" << endl;
    } 
    return 0;
}