//satyaki3794
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define MOD (1000000007LL)
#define LEFT(n) (2*(n))
#define RIGHT(n) (2*(n)+1)

using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;

ll pwr(ll base, ll p, ll mod = MOD){
ll ans = 1;while(p){if(p&1)ans=(ans*base)%mod;base=(base*base)%mod;p/=2;}return ans;
}


ll gcd(ll a, ll b){
    if(b == 0)  return a;
    return gcd(b, a%b);
}



int sieve[100005];

int main(){

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    sieve[1] = 1;
    for(int i=2;i<=100000;i++)
    	if(!sieve[i])
    		for(int j=2*i;j<=100000;j+=i)
    			sieve[j] = 1;

    for(int i=1;i<=100000;i++){
    	sieve[i] = 1-sieve[i];
    	sieve[i] += sieve[i-1];
    }

    int t;
    cin>>t;
    while(t--){

    	int n;
    	cin>>n;

    	n = sieve[n];
    	if(n % 2 == 1)	cout<<"Alice\n";
    	else	cout<<"Bob\n";
    }
    return 0;
}