#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
#include <algorithm>
#include <queue>
#include <string>
#include <cmath>
#include <map>
#include <set>
#include <cassert>
#define MOD 1e9 + 7
#define eps 1e-9
#define pb push_back
#define mp make_pair
#define ft first
#define sd second
#define sz(a) a.size()
#define loop(i, n) for(long long (i) = 0; (i) < (n) ; ++ (i))
#define loopn()
#define pii pair<int,int>
#define pll pair<long long,long long>
#define vii vector<int>
#define vll vector<long long>  
typedef long long ll;
typedef long double ld;
 
using namespace std;
 
/*@Sergey_Miller*/

vll primes;
ll numb[100001];

void calc() {
    for(ll i = 2;i < 100001;++i) {
        bool er = 0;
        loop(j,sz(primes)) {
            if(i % primes[j] == 0) {
                er = 1;
                break;
            }
        }
        if(!er) {
            primes.pb(i);
        }
        numb[i] = sz(primes);
    }
}

void solve() {
    ll g;
    cin >> g;
    loop(t,g) {
        ll n;
        cin >> n;
        cout << (numb[n] % 2 == 1 ? "Alice" : "Bob") << endl;
    }
}
 
int main () {
    ios::sync_with_stdio(false);
    // freopen("input.txt", "r", stdin);
 //  freopen("output.txt", "w", stdout);
    calc();
    solve();
    // cout << 10000000320 % 1000000033;
    // cout << 92381%17;
    return 0;
}