#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 main()
{
    int g,prime[100000];
    cin >> g;
    memset (prime,0,sizeof(prime));
    for (int i = 2; i < 100000; i++)
    {
        if (!prime[i])
        {
            for (int j = i + i; j <= 100000; j += i)
                prime[j] = 1;
        }
    }
    prime[1] = 1;
    for(int a0 = 0; a0 < g; a0++)
    {
        int n;
        cin >> n;
        int val = 0;
        for (int i = 1; i <= n; i++)
            val += prime[i];
        val = n - val;
        if (val % 2 == 0)
            cout<<"Bob"<<endl;
        else
            cout<<"Alice"<<endl;
    }
    return 0;
}