#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 <unordered_map>

using namespace std;

bool isPrime[100001];
int prevPrimes[100001];
int main(){
    memset(isPrime, true, sizeof isPrime);
    isPrime[0] = isPrime[1] = false;
    for (int i = 2; i < 100001; ++i) {
        prevPrimes[i] = prevPrimes[i - 1] + isPrime[i];
        if (i < 100001 / i && isPrime[i]) {
            for (int j = i*i; j < 100001; j += i) {
                isPrime[j] = false;
            }
        }
    }

    string res[] = {"Alice\n", "Bob\n"}; 
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        cout << res[!(prevPrimes[n] % 2)];
    }
    return 0;
}