//
//  main.cpp
//  101Hack44
//
//  Created by BahadirAltun on 13/12/16.
//  Copyright © 2016 Bahadir Altun. All rights reserved.
//

#include <algorithm>
#include <iostream>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <string>
#include <vector>
#include <cmath>
#include <ctime>
#include <queue>
#include <stack>
#include <map>
#include <set>

using namespace std;

#define mid ((lf + rg) >> 1)
#define right (left | 1)
#define left (v << 1)

typedef pair<int, int> pii;
typedef long long ll;

const ll linf = 1e18 + 9;
const int inf = 1e9 + 9;
const int N = 1e5 + 9;

int t, n, dp[N], prim[N];

int main() {

  scanf("%d", &t);

  for (int i = 2; i < N; i++) {
    if (prim[i]) continue;
    prim[i] = 2;
    for (int j = i + i; j < N; j += i)
      prim[j] = 1;
  }

  for (int i = 2; i < N; i++)
    dp[i] = dp[i - 1] + (prim[i] == 2);

  for (int tt = 1; tt <= t; tt++) {
    scanf("%d", &n);
    if (dp[n] % 2 == 0) puts("Bob");
    else puts("Alice");
  }

  return 0;
}