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

//alice move first, bob move second
#define ALICE 1
#define BOB 2

bool isPrime(int n) {
    for(int i = 2; i <= n/2; i++) {
        if (n%i==0) return false;
    }
    return true;
}

int countPrime(int n) {
    int result = 0;
    for (int i = 2; i <= n; i++) {
        if (isPrime(i)) result++;
    }
    return result;
}

void solve(int n) {
    if (n == 1) {
        cout << "Bob" << endl;
        return;
    }
    if (n == 2) {
        cout << "Alice" << endl;
        return;
    }
    int primes = countPrime(n);
    //cout << "num of prime " << primes << endl;
    if (primes % 2 == 1) {
        cout << "Alice" << endl;
    } else {
        cout << "Bob" << endl;
    }
}


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