#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;

static bool prime_array[100003];

void prime_numbers(int end){
	int sqrtnum=0;
	int i=0, j=0;
	if(end > 1){
		sqrtnum = (int)(sqrt(end));	
		prime_array[0] = false;
		prime_array[1] = false;
		prime_array[2] = true;
		for(i=4;i<=end+2;i+=2){
			prime_array[i] = false;
		}
		for(i=3;i<=end+2;i+=2){
			prime_array[i] = true;
		}
		i=3;
		while(i<=sqrtnum){
			j = (i*i);
			while(j<=end){
				prime_array[j] = false;
				j +=i;
			}
			i+=2;
			while(!prime_array[i]){
				i+=2;
			}
		}
	}
}

int main(){
    prime_numbers(100000);
    bool player = true;
    int i =0;
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        player = true;
        cin >> n;
        for(i =1; i<=n; i++){
            if(prime_array[i]){
                if(player)
                    player = false;
                else
                    player = true;
            }
                
        }
        if(player)
            printf("Bob\n");
        else
            printf("Alice\n");
    }
    return 0;
}