#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 prime[100001];
void Sieve(int n)
{
    for (int p=2; p*p<=n; p++)
    {
        // If prime[p] is not changed, then it is a prime
        if (prime[p] == true)
        {
            // Update all multiples of p
            for (int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }
 
}

int main(){
    for(int i=0;i<100001;i++)
        prime[i]=true;
    Sieve(100000);
    prime[1]=false;
    prime[0]=false;
    int count=0;
    long int prime1[100001];
    for(int i=0;i<100001;i++)
        {
        if(prime[i]==true)
            count++;
        prime1[i]=count;
    }
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        if(prime1[n]%2==0)
            cout<<"Bob"<<endl;
        else
            cout<<"Alice"<<endl;
        // your code goes here
    }
    return 0;
}