#include <cstdio>
#include <cstring>
#include <cmath>
#include <queue>
#include <cstring>
#include <vector>
#include <string>
#include <stack>
#include <set>
#include <map>
#include <iostream>
#include <algorithm>
using namespace std;
#define MP make_pair
#define PB push_back
typedef long long LL;
typedef pair<int, int> Pii;
const int inf = 0x3f3f3f3f;
const LL INF = (1uLL << 63) - 1;
const LL mod = 1000000007;
const double Pi = acos(-1.0);
const int maxn = 1e5 + 5;
#define mid (( l + r ) >> 1)
#define lson l,mid, o<<1
#define rson mid+1,r,o<<1|1
bool prime[maxn];
int sum[maxn];
void get_prime(){
    for(int i = 2; i < maxn; i++){
        if(!prime[i]){
            for(int j = i + i; j < maxn; j += i){
                prime[j] = 1;
            }
        }
    }
    for(int i = 2; i < maxn; i++){
        sum[i] = sum[i-1] + (prime[i]==0);
    }
}
int main() {
#ifdef local
    freopen("in", "r", stdin);
#endif
    ios::sync_with_stdio(false);
    get_prime();
    int g;
    cin>>g;
    while(g--){
        int n;
        cin>>n;
        if(sum[n]&1){
            cout<<"Alice"<<endl;
        }
        else cout<<"Bob"<<endl;
    }
}