#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;
        // your code goes here
        if (n < 2) {
            cout << "Bob" << endl;
        }
        else if (n < 6) {
            cout << "Alice" << endl;
        }
        else {
            int primes = 2;
            for (int v = 5; v < n; ++v) {
                bool isPrime = true;
                for (int p = 2; p < (int)sqrt(v); ++p) {
                    if (v % p == 0) {
                        isPrime = false;
                        break;
                    }
                }
                if (isPrime) {
                    ++primes;
                }
            }
            if (primes % 2 == 1) {
                cout << "Alice" << endl;
            } else {
                cout << "Bob" << endl;
            }
        }
    }
    return 0;
}