#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[100000];

bool isPrime(int x){
    if(x%2==0) return false;
    for(int i=3;i*i<=x;i+=2)
        if(x%i==0) return false;
    return true;
}

void countPrime(){
    int count=2;
    prime[0]=0;
    prime[1]=0;
    prime[2]=1;
    prime[3]=2;
    for(int i=4;i<=100000;i++){
        if(isPrime(i)) count++;
        prime[i]=count;
    }
}

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