#include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>

using namespace std;

#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define TRACE(x) cout << #x << " = " << x << endl
#define _ << " _ " <<

typedef long long llint;

const int MAX = 100010;

int c[MAX];
int f[MAX];

int main(void) {
  c[1] = 1;
  for (int i = 2; i*i < MAX; ++i)
    if (!c[i])
      for (int j = i*i; j < MAX; j += i)
        c[j] = i;

  FOR(i, 1, MAX) f[i] = f[i-1] + (c[i] == 0);
  
  int t;
  scanf("%d", &t);
  while (t--) {
    int n;
    scanf("%d", &n);
    if (f[n] % 2) puts("Alice");
    else puts("Bob");
  }
  return 0;
}