#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;

const int MAXN = 100100;
int G, N;
int P[MAXN];
int ans[MAXN];

int main()
{
    for (int i = 2; i < MAXN; i++)
        for (int j = i; j < MAXN; j += i)
            P[j]++;
    
    for (int i = 2; i < MAXN; i++)
        ans[i] += ans[i - 1] + (P[i] == 1);
        
    cin >> G;
    for (int g = 0; g < G; g++)
    {
        cin >> N;
        if (ans[N] % 2 == 1)
            cout << "Alice\n";
        else
            cout << "Bob\n";
    }
    
    return 0;
}