#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 main(){
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        int arr[n];
        for(int i = 0; i <= n; ++i)
            {
                arr[i] = 1;
            }
     arr[0] = 0;
	arr[1] = 0;
	for(int i = 2; i <= sqrt(n); ++i)
	{
		if(arr[i] == 1)
		{
			for(int j = 2; i*j <= n; ++j)
			{
				arr[i*j] = 0;
			}
		}
	}
     
        long count = 0;
        for(int i = 0; i <= n; ++i)
            {
            if(arr[i] == 1)
                {
                ++count;}
            }
        if(count%2 == 1){
            cout << "Alice" << endl;
        }
        else {
        cout << "Bob" << endl;}
    }
    return 0;
}