#define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/stack:16777216")
#include <string>
#include <vector>
#include <map>
#include <list>
#include <iterator>
#include <set>
#include <queue>
#include <iostream>
#include <sstream>
#include <stack>
#include <deque>
#include <cmath>
#include <memory.h>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <algorithm>
#include <utility>
#include <assert.h>
#include <time.h>


#include <fstream>
#include <sys/stat.h>
#include <stdlib.h>
#include <stdio.h>
using namespace std;

#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, b, a) for(int i=(b)-1;i>=(a);--i)
#define FILL(A,value) memset(A,value,sizeof(A))
#define ALL(V) V.begin(), V.end()
#define SZ(V) (int)V.size()
#define PB push_back
#define MP make_pair
#define Pi 3.14159265358979

typedef long long Int;
typedef unsigned long long UInt;
typedef vector<int> VI;
typedef pair<int, int> PII;

const int INF = 1000000000;
const int MAX = 100007;
const int MAX2 = 1000000;
const int MAXD = 20;
const int BASE = 1000000007;
const int MOD = 1000000007;

bool isPrime(int x)
{
    for(int i = 2; i * i <= x; ++i)
        if (x % i == 0) return 0;
    return 1;
}

int a[MAX];

int main() {
    
    //freopen("in.txt" , "r" , stdin);
    
    FOR(i,2,MAX)
        a[i] = a[i - 1] + isPrime(i);
    
    int t;
    cin >> t;
    FOR(i,0,t)
    {
        int x;
        cin >> x;
        if (a[x] % 2 == 1) cout << "Alice"<< endl;
        else cout << "Bob"<< endl;
    }
    
    return 0;
}