//it isn't too tough :)
#include<bits/stdc++.h>
#define ll long long int
#define loop(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define bp 1000000007
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define F first
#define S second
using namespace std;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
const int Lim=1e5+5;
bool sieve[Lim];
ll cum[Lim],n;
void pre(){
    sieve[1]=1;
    for(ll i=2;i<=ceil(sqrt(Lim))+2;i++){
        if(sieve[i]==0){
            ll j=i*i;
            while(j<=Lim){
                sieve[j]=1;
                j+=i;
            }
        }
    }
    loop(i,1,Lim){
        cum[i]=cum[i-1]+1*(sieve[i]==0);
    }
}

void solve(){
	cin>>n;
    if(cum[n]&1)
        cout<<"Alice\n";
    else
        cout<<"Bob\n";
}
int main (){
	ll t;
	cin>>t;
	pre();
	while(t--){
		solve();
	}
	return 0;
}