#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[100002];
void sieve(){
    for(int i = 0; i < 100002; i++)isPrime[i] = true;
    isPrime[1] = false;
    for(int i = 2; i < 100001, isPrime[i] == true; i++){
        for(int j = 2*i; j < 100001; j += i){
            isPrime[j] = false;
        }
    }
}

int main(){
    int g;
    cin >> g;
    sieve();
    int a[100001];
    a[0] = 0;
    a[1] = 0;
    a[2] = 1;
    for(int i = 3; i < 100001; i++){
        if(isPrime[i])a[i] = a[i-1] + 1;
        else a[i] = a[i-1];
    }
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        // your code goes here
        if(a[n]%2 == 1){
            cout<<"Alice"<<endl;
        }else{
            cout<<"Bob"<<endl;
        }
    }
    return 0;
}