#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int primes[10000];
int primes_count = 1;
int last_checked = 2;

void generate(int N) {
  if(N <= last_checked) return;
  for(int i = last_checked + 1; i <= N; i++) {
    int j = 0, i2 = sqrt(i);
    bool is_prime = true;
    while(j < primes_count && primes[j] <= i2) {
      if(i % primes[j] == 0) {
        is_prime = false;
        break;
      }
      ++j;
    }
    if(is_prime) {
      primes[primes_count++] = i;
    }
  }
  last_checked = N;
}



int main() {
  primes[0] = 2;
  int T;
  cin >> T;
  while(T--) {
    int N;
    cin >> N;
    generate(N);
    int *higher = upper_bound(primes, primes + primes_count, N);
    cout << ((higher - primes) % 2 == 1 ? "Alice" : "Bob") << "\n";
  }
  //for(int i = 0; i < primes_count; ++i) cout << primes[i] << " ";
  return 0;
}