#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 countPrimes(int n) {
        bool *isprime = new bool[n + 1];
        for (int i = 2; i < n + 1; i ++) {
            isprime[i] = true;
        }
        for (int i = 2; i*i <= n; i ++) {
            if (isprime[i]) {
                for (int j = i * i; j <= n; j += i) {
                    isprime[j] = false;
                }
            }
        }
        int cnt = 0;
        for (int i = 2; i <= n; i ++) {
            if (isprime[i]) {
                cnt ++;
            }
        }
        return cnt;
    }

int main(){
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        int cnt=countPrimes(n);
if(cnt%2==0){
        cout<<"Bob"<<endl;
    }
    else cout<<"Alice"<<endl;
    }

    return 0;
}