#include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define FOR(x,n) for(int x = 0; x < n; x++)
#define SZ(a) ((int)(a).size())
using namespace std;

const int MXN = 1e5 + 1;
int np[MXN] = {};
vector<int> primes;
int main() {
  primes.push_back(2);
  for(int x = 3; x < MXN; x+=2)
    if(!np[x]) {
      primes.push_back(x);
      for(int y = 2*x; y <MXN; y+=x) np[y] = 1;
    }
    
  int G; cin >> G;
  while(G--) {
    int N; cin >> N;
    cout << ((upper_bound(ALL(primes),N)-primes.begin())%2 == 0? "Bob" : "Alice") << "\n";
  }
}