#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <bitset>
using namespace std;
typedef long long LL;

bitset<300001> b;
std::vector<int> primes;
const int UB = (2e5);

void sieve() {
  b.reset();
  b.flip();
  int sq = sqrt(UB);
  for (LL i = 2; i < UB; i++) {
    if (b.test(i)) {
      primes.push_back(i);
      for (LL j = i * i; j < UB; j += i) {
        b.set(j, 0);
      }
    }
  }
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    sieve();
    int t, n;
    for (cin >> t; t--;) {
        cin >> n;
        int idx = upper_bound(primes.begin(), primes.end(), n) - primes.begin();
        if (idx & 1) cout << "Alice\n";
        else cout << "Bob\n";
    }
    return 0;
}