#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <stdio.h>

using namespace std;
bool prime[900001];

void start(){
    memset(prime, true, sizeof(prime));
    int i, j;
    prime[0] = false;
    prime[1] = false;
    for(i=2; i<=50000; i++){
        for(j=i*2; j<=100000; j+=i)
            prime[j] = false;
    }
}

int primec(int a){
    int i, count = 1;
    if(a<2) return 0;
    for(i=3; i<=a; i++){
        if(prime[i])
            count++;
    }
    return count;
}

int main(){
    int g, n, i, a;
    cin >> g;
    start();
    for(i=0; i<g; i++){
        cin >> a;
        n = primec(a);
        if(n%2 == 0)
            cout << "Bob" << endl;
        else 
            cout << "Alice" << endl;
    }
    return 0;
}