#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 is_prime(int n)
    {
    for(int i=2;i<=sqrt(n);i++)
        {
        if(n%i==0)return false;
    }
    return true;
}

int findprime(int n,int i,int j,vector<int> &primes)
    {
     if(i==j)return i;
     int mid = (i+j)/2;
     if(n==primes[mid])return mid;
     else if(n>primes[mid])return findprime(n,mid+1,j,primes);
     else return findprime(n,i,mid,primes);   
     //return 0;
}

int main(){
    int g;
    cin >> g;
    vector<int>primes;
    for(int i=1;i<=100000;i++)
        {
        if(is_prime(i))primes.push_back(i);
    }
    //cout<<primes.size()<<" "<<primes[primes.size()-1];
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        int t = findprime(n,0,primes.size()-1,primes);
        
        if(primes[t]>n)t--;
        if(t%2==0)cout<<"Bob"<<endl;
        else cout<<"Alice"<<endl;
    }
    return 0;
}