#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#define MAX 1000007
using namespace std;

long long int prime[MAX]={0};


int main() 
{
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    long long int n,i,j,k,p,c=0;
    cin>>n;
    for ( i = 2; i < MAX; i += 2)	prime[i] = 1;//even numbers have smallest prime factor 2
	for ( i = 3; i < MAX; i += 2){
		if (!prime[i]){
			
			for ( j = i+i; j < MAX; j += i){
					prime[j] = 1;
			}
		}
	}
    prime[1]=0;
    prime[2]=0;
    while(n--)
    {
        c=0;
        long long int k;
        cin>>k;
        for(i=1;i<=k;i++)
            if(!prime[i])
            c++;
            
            
            if(c%2==1)
            cout<<"Bob"<<endl;
            else
            cout<<"Alice"<<endl;
    }
    
    return 0;
}