#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>
#include <iterator>

using namespace std;
int person = 0;

int findFirstPrime(int arr[]) {
    int size = (sizeof(arr)/sizeof(*arr));
    for (int k = 0; k < size; k++) {
        bool isPrime = true;
        for(int i = 2; i <= arr[k] / 2; ++i) {
            if(arr[k] % i == 0) {
                isPrime = false;
                break;
            }
        }
        if(isPrime) {
            return arr[k];
        }
    }
    return -1;
}

int ifOdd(int num) {
    if(num % 2 == 0) {
        return 0;
    }
    return 1;
}

void erase(int arr[], int n) {
    int size = (sizeof(arr)/sizeof(*arr));
    for(int i = 0; i < size; i++)
	{
		if(arr[i] == n)
		{
			for(int j = i; j < (size-1); j++)
			{
				arr[j] = arr[j+1];
			}
			break;
		}
	}
}


int main(){
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        int num[n];
        for (int q = 0; q < n; q++) {
            num[q] = q+1;
        }
        
        int prime = findFirstPrime(num);
        do {
            if(prime != -1) {
                person++;
                int size = (sizeof(num)/sizeof(*num));
                for (int j = 0; j < size; j++) {
                    if(num[j] % prime == 0) {
                        erase(num, num[j]);
                    }
                }
            }
            prime = findFirstPrime(num);
        } while (prime != -1);
    
        if(ifOdd(person) == 1)
            cout << "Bob";
        else
            cout << "Alice";  
    }
    return 0;
}