#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 pr[100009];
int cnt[100009];

void sieve() {
    
    for (int i = 0; i < 100009; i ++) {
        pr[i] = 1;
    }
    pr[0] = pr[1] = 0;
    
    for (int i = 2; i < 100009; i ++) {
        if (!pr[i])
            continue;
        for (int j = i + i; j < 100009; j += i) {
            pr[j] = 0;
        }
    }
    
    cnt[0] = cnt[1] = 0;
    for (int i = 2; i < 100009; i ++) {
        cnt[i] = cnt[i - 1] + pr[i];
    }
}
int main(){
    sieve();
    int g;
    cin >> g;
    
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        // your code goes here
        int ans = cnt[n];
        if (ans % 2 == 0) {
            printf("Bob\n");
        } else {
            printf("Alice\n");
        }
    }
    return 0;
}