#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 count = 0;
        if (a0 > 0) cout << "\n";
        for (int i = 2; i <= n ; ++i) {
            int prime = 1;
            for (int j = 2; j * j <= i; ++j) {
                if (!(i % j)) {
                    prime = 0;
                    break;
                }
            }
            if (prime) ++count;
        }
        if (count % 2) cout << "Alice";
        else cout << "Bob";
    }
    return 0;
}