#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#define s(n) scanf("%d", &n)
using namespace std;

int count_primes(int n, vector<bool> sieve_hash) {
 if(n == 1)
    return 0;
  int counter = 0;

  for(int i = 2; i <= n; i++) {
    if(sieve_hash[i])
      counter += 1;
  }
  return counter;
}

int main() {
  vector<int> sieve = {2,  3,  5,  7,  11,  13,  17,  19,  23,  29,  31,  37,  41,  43,  47,  53,  59,  61,  67,  71,  73,  79,  83,  89,  97,  101,  103,  107,  109,  113,  127,  131,  137,  139,  149,  151,  157,  163,  167,  173,  179,  181,  191,  193,  197,  199,  211,  223,  227,  229,  233,  239,  241,  251,  257,  263,  269,  271,  277,  281,  283,  293,  307,  311,  313,  317};

  vector<bool> sieve_hash(100003, false);
  for(int i = 2; i <= 100000; i++) {
    int pf = false;
    for(int x: sieve) {
      if(x > sqrt(i))
        break;

      if(i % x == 0) {
        pf = true;
        break;
      }
    }
    if(pf == false)
      sieve_hash[i] = true;
  }


  int g; s(g);
  while(g--) {
    int n; s(n);
    int c = count_primes(n, sieve_hash);

    if(c % 2 == 0)
      cout << "Bob\n";
    else
      cout << "Alice\n";
  }

  return 0;
}