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


bool isItPrime(int n) {
    if (n == 1) {
        return false;
    }
    else if (n == 2) {
        return true;
    }
    else {
        for (int c = 2; c <= sqrt(n); c++) {
            if (n % c == 0) {   // if n % c does not produce a remainder, n is not prime
                return false;
            } 
        }  
    }
    return true;
}

void play_game(int n) {
    int primes_count = 0;
    for (int b = 1; b <= n; b++) {
        if (isItPrime(b)) {
            primes_count++;
        }
    }
    if (primes_count % 2 == 0){
        cout << "Bob" << endl;
    }
    else {
        cout << "Alice" << endl;
    }
}

int main(){
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        play_game(n);
    }
    return 0;
}