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

const int maxn = 200000;
int is_p[maxn], sum_p[maxn + 1];

int main(){
    memset (is_p, 0, sizeof (is_p));
    memset (sum_p, 0, sizeof (sum_p));
    for (int i = 2; i < maxn; i++) {
      is_p[i] = 1;
    }
    for (int i = 2; i < maxn; i++) {
      if (!is_p[i])
        continue;
      for (int j = i + i; j < maxn; j += i)
        is_p[j] = 0;
    }
    sum_p[0] = 0;
    for (int i = 0; i < maxn; i++) {
      sum_p[i + 1] = sum_p[i] + is_p[i];
    }
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        int k = sum_p[n + 1];
        puts (k % 2 == 1 ? "Alice" : "Bob");
        // your code goes here
    }
    return 0;
}