// Made By Haireden Aibyn
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <string>
#include <cstdio>
#include <vector>
#include <cmath>
#include <ctime>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>

using namespace std;

#define fname ""
#define INF 2147483647
#define MOD 1000000007
#define mp make_pair
#define F first
#define S second
#define sc scanf
#define all(x) x.begin(), x.end()
#define size(x) int(x.size())
#define pr printf
#define deb(x) cerr << " | " << #x << " = " << x
#define pb push_back
#define ex exit(0)
#define tim printf("%.4lf\n", (clock() * 1.) / CLOCKS_PER_SEC)
#define cas printf(""), ex;
#define y1 y4

typedef long long ll;
typedef unsigned long long ull;

const int N = 100500;

bool was[N];
int pref[N];

int main() {
    srand(time(NULL));
    for (int i = 2; i <= 1e5; i++) {
        if (!was[i]) {
           pref[i]++;
           int j = i;
           while (j + i <= 1e5) {
                 was[j + i] = 1;
                 j += i;           
           }
        }    
        pref[i] += pref[i - 1];
    }
    int test;
    sc("%d", &test);
    for (int i = 1; i <= test; i++) {
        int n;
        sc("%d", &n);
        if (pref[n] % 2 == 0) {
           puts("Bob");
        } else {
           puts("Alice");
        }
    }
    return 0;
}