#include <bits/stdc++.h>
#define x first
#define ll long long
#define mk make_pair
#define y second
#define pb push_back
#define pll pair<ll, ll>
#define pii pair<int, int>
#define inf INT_MAXoverl
#define rep(i, a, b) for (int i = a; i <= b; ++i)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 5;
int cnt[maxn];
void sieve() {
  vector<int> prime(maxn, 1);
  for (int i = 2; i * i < maxn; i++) {
    if (prime[i] == 0)
      continue;
    for (int j = i * 2; j < maxn; j += i)
      prime[j] = 0;
  }
  for (int i = 2; i < maxn; i++) {
    if (prime[i])
      cnt[i] = 1;
  }
}
int main() {
  ios::sync_with_stdio(false);
  int t;
  cin >> t;
  sieve();
  rep(i, 3, maxn - 1) cnt[i] += cnt[i - 1];
  while (t--) {
    int n;
    cin >> n;
    if (cnt[n] % 2 != 0) {
      cout << "Alice"<<"\n";
    } else
      cout << "Bob\n";
  }
  return 0;
}