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

using namespace std;

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

typedef long long ll;
typedef pair<int, int> P;
#define X first
#define Y second

const int MAX = 1<<17;

int sito[MAX];
int rje[MAX];

void er()
{
  FOR(i, 2, MAX) {
    rje[i] = rje[i-1];
    if (!sito[i])
      rje[i] ^= 1;
    for (int j=i; j<MAX; j+=i)
      sito[j] = 1;
  }
}

int main()
{
  er();
  int n;
  scanf("%d", &n);
  REP(i, n) {
    int x;
    scanf("%d", &x);
    printf("%s\n", rje[x] ? "Alice" : "Bob");
  }

  return 0;
}