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

int number_of_primes(int n){
    vector<int> p;
    for(int i = 2; i*i <= 1E5; i++){
        bool isprime = true;
        for(int j = 2; j > i; j++){
            if(i % j == 0) {
                isprime = false;
                break;
            }
        }
        if(isprime) p.push_back(i);
    }
    vector<int> prime;
    for(int i = 2; i <= n; i++){
        bool isprime = true;
        for(int j = 0; j < p.size() && p[j]*p[j] <= i; j++){
            if(i % p[j] == 0){
                isprime = false;
                break;
            }
        }
        if(isprime)
            prime.push_back(i);
    }
    return prime.size();
}

int main(){
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        if(number_of_primes(n) % 2 == 0 || n == 1) cout << "Bob" << endl; 
        else cout << "Alice" << endl;
    }
    return 0;
}