#include <map>
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
#define test int t;scanf("%d", &t);while(t--)
#define sd(n) scanf("%d", &n)
#define loop(i, n) for(int i = 0;i<n;i++)
#define kloop(i, k, n) for(int i=k;i<n;i++)
#define rloop(i, n) for(int i = n;i>=0;i--)
#define rkloop(i, n, k) for(int i = n;i>=k;i--)
#define MOD 1000000007
#define PI 3.1415926535897932384626433832795
#define interactive(x) cout<<x<<"\n";fflush(stdout)
#define fil(name, val) memset(name, val, sizeof(name))
#define pb push_back
#define ll long long
/*int fact[MAXN];
int invfact[MAXN];
int inv(int a, int b){
    if(b==0)
        return 1;
    if(b&1)
        return (long long)a*inv(a, b-1)%MOD;
    else{
        int res = inv(a, b>>1);
        return (long long)res*res%MOD;
    }
}
void init(){
    fact[0] = 1;
    for(int i=1;i<MAXN;i++){
        fact[i] = (long long)fact[i-1]*i%MOD;
    }
    invfact[MAXN-1] = inv(fact[MAXN-1], MOD-2);
    for(int i=MAXN-1;i>0;i--){
        invfact[i-1] = (long long)invfact[i]*i%MOD;
    }
}
int C(int n, int r){
    if(r>n || r<0)
        return 0;
    return (long long)((long long)fact[n]*invfact[r]%MOD)*invfact[n-r]%MOD;
}*/
int n, prime[100005];
void solve(){
    fil(prime, 1);
    prime[0] = 0;
    prime[1] = 0;
    for(int i=2;i<100005;i++){
        if(!prime[i])   continue;
        for(int j=i+i;j<100005;j+=i){
            prime[j] = 0;
        }
    }
    test{
        sd(n);
        int cnt = 0;
        loop(i, n+1){
            cnt+=prime[i];
        }
        if(cnt%2==0)    printf("Bob\n");
        else    printf("Alice\n");
    }
}
int main(){
    /*FILE *fin = freopen("C-small-attempt0.in", "r", stdin);
	assert( fin!=NULL );
	FILE *fout = freopen("C-small.out", "w", stdout);*/
    solve();
    return 0;
}