#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;
 vector<int> prime(100005,1);
void sieve()
{
    
    prime[0]=prime[1]=0;
    for (int p=2; p*p<=100000; p++)
    {
        if (prime[p])
        {
            // Update all multiples of p
            for (int i=p*2; i<=100000; i += p)
                prime[i] = 0;
        }
    }

    // Print all prime numbers
    for (int p=2; p<=100005; p++)
       prime[p]=prime[p]+prime[p-1];   
}

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