#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

int prime[300000],n;
int mark[1000002];

void pime(){
	
	int i,j,x;
	for(i=2;i<1000002;i++)
		mark[i]=0;
	x=sqrt(1000002)+2;
	
	for(i=3;i<=x;i+=2){
		if(mark[i]==0){
			for(j=i*i;j<1000002;j+=i*2)
				mark[j]=1;
			}
		}
	
	n=1;
		
	prime[n++]=2;
	for(i=3;i<1000002;i+=2){
		if(mark[i]==0)
			prime[n++]=i;
		}
	}

int lowerbound (int a) {
    
    
    int left = 1, right = n-1, mid;
   // cout <<left << " " << right << endl;
    
    while ( left <= right ) {
        
        mid = ( left+right )/2;
        
        if (prime[mid]==a){
            
            return mid;
        }
        else if (prime [mid]>a) {
            right = mid -1;
        }
        else
            left = mid + 1;
        
    }
    return right;
    
}

int main(){
    pime();
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int a;
        cin >> a;
        int c = lowerbound (a);
    //    cout << c << endl;
        
        if (c<1)
            cout << "Bob" << endl;
        else if (c%2==0)
             cout << "Bob" << endl;
        else
            cout << "Alice" << endl;
    }
    return 0;
}