#include<iostream>
#include <bits/stdc++.h>
#include<math.h>
#define max 100005

using namespace std;

int nums[max];

void SOE(int n)
{
    bool prime[n+1];
    memset(prime, true, sizeof(prime));
 
    for (int p=2; p*p<=n; p++)
    {
        if (prime[p] == true)
        {
            for (int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }
 
    int k = 0;
    for (int p=2; p<=n; p++){
        if (prime[p]){
           nums[k++] = p;
        }
    }     
}

int main(){
	int g;
	cin>>g;
	SOE(max);
	for(int i=1;i<=g;i++){
		int n;
		cin>>n;
		int ans=0;
		for(int j=0;j<max;j++){
			if(n<nums[j]){
				ans = j;
				break;
			}
			else if(n==nums[j]){
				ans = j+1;
				break;
			}
		}
	//	cout<<"ans: "<<ans<<endl;
		if(ans%2==1){
			cout<<"Alice"<<endl;
		}
		else{
			cout<<"Bob"<<endl;
		}
	}
}