#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<math.h>
#include <unordered_map>

using namespace std;


int is_prime(long long int num)
{
    int isprime = 0;
	for(int i = 2; i <=num/2; i ++)
	{
		if(num % i == 0)
		{
			isprime=1;
			break;
		}
		
	}

	return isprime;
}

int main(){
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        long long int n;
        cin >> n;
        int count=0;
        for(long long int i=2;i<=n;i++)
            {
            if(!is_prime(i))
                count++;
        }
        if(count%2==0)
            cout<<"Bob"<<endl;
        else
            cout<<"Alice"<<endl;
    }
    return 0;
}