#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 sievecount(int n) {
    int count = 0;
    int sn = ceil(sqrt(n));
    vector<bool> prime(n + 1, true);
    prime[0] = false;
    prime[1] = false;
    if(n == 2) {
        return 1;
    }
    for(int i = 2; i <= n; i++) {
        if(prime[i]) {
            count++;
            if(i <= sn) {
                for(int j = i+i; j <= n;  j += i) {
                    prime[j] = false;
                }
            }
        }    
    }
    return count;
}

int main(){
    int g; cin >> g;
    while(g--) {
        int n; cin >> n;
        if(sievecount(n) % 2 == 0) {
            cout << "Bob" << endl;
        } else {
            cout << "Alice" << endl;
        }
    }
    return 0;
}