#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;
const int NN = 100005;
vector<int> prime;
void sieve(){
    bitset<NN+10> bt;
    bt.set();
    bt[0] = bt[1] = 0;
    for(int i = 2; i <= NN; i++){
        if(bt[i]){
            for(long long j = 1LL*i*i; j <= NN; j+=i) bt[j] = 0;
            prime.push_back(i);
        }
    }
}

string solve(int n){
    if(n < 2) return "Bob";
    if(n == 2) return "Alice";
    if(n == 3) return "Bob";
    int p = lower_bound(prime.begin(), prime.end(),n) - prime.begin();
    if(prime[p] > n) p--;
    if(p % 2 == 0) return "Alice";
    else return "Bob";
}
int main(){
    sieve();
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        cout<<solve(n)<<endl;
    }
    return 0;
}