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

bool cribe[MAX] = {false};
int dp[MAX] = {0};

void generate(int n){
  cribe[2] = true;
  for(int i = 1; i < n; i+=2){
    cribe[i] = true;
  }
  cribe[1] = false;
  for(int i = 3; i*i < n; i += 2){
    if(cribe[i]){
      for(int j = 2 * i; j < n; j += i){
        cribe[j] = false;
      }
    }    
  }
  for(int i = 2; i < n; i++){

    dp[i] = dp[i-1] + (cribe[i] == true ? 1 : 0);
//    cout << i << " " << cribe[i] << " " << dp[i] << endl;
  }
  return;
}

string solve(int n){
//  cout << dp[n] << endl;
  return (dp[n] & 1) ? "Alice" : "Bob";
}

int main() {
  int cases;
  generate(MAX-1);
  cin >> cases;
  for(int i = 0; i<  cases; i++){
    int n;
    cin >> n;    
    cout << solve(n) << endl;
  }
  return 0;
}