#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 prime[100007];
void sieve(){
    int i,j;
    for(i = 2;i <= 100000;i++)prime[i] = 1;
    prime[1] = 0;
    for(i = 2;i <= 1000;i++){
        if(prime[i]){
            for(j = i+i;j <= 100000;j += i)prime[j] = 0;
        }
    }
    for(i = 2;i <= 100000;i++)prime[i] += prime[i-1];
}

int main(){
    int g;
    sieve();
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        if(prime[n]%2 == 0)cout<<"Bob\n";
        else cout<<"Alice\n";
        // your code goes here
    }
    return 0;
}