#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 10;

int isPrime (int n) {
  if (n == 3) return 1;
  if (n == 5) return 1;
  for (int j = 2; j < (int) sqrt(n) + 1; j++) {
    if (n % j == 0) return 0;
  }
  return 1;
}

int cnt[2 * N];

int main() {

  cnt[2] = 1;
  for (int i = 3; i <= N; i++) {
    cnt[i] = isPrime(i);
    cnt[i] += cnt[i - 1];
  }

  int g; cin >> g;

  while (g--) {
    int n; cin >> n;
    if (cnt[n] & 1) {
      cout << "Alice\n";
    } else cout << "Bob\n";
  }

  return 0;
}