#include <bits/stdc++.h>

using namespace std;

vector <int> pr;

const int N = 100005;
int used[N];

int main()
{
  for (int i = 2; i < N; ++i) {
    if (!used[i]) {
      pr.push_back(i);
      for (long long j = i *1LL * i; j < N; j += i) {
        used[j] = 1;
      }
    }
  }
  int t;
  scanf("%d", &t);
  
  while (t--) {
    int n;
    scanf("%d", &n);
    
    printf("%s\n", (upper_bound(pr.begin(), pr.end(), n) - pr.begin()) % 2 ? "Alice" : "Bob");
  }
  return(0);
}