#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <queue>
#include <stack>
#include <unordered_set>
#include <unordered_map>

using namespace std;

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

const ll mod = 998244353;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  int t;
  cin >> t;
  vector<ll> n(t);
  for (auto &x: n) cin >> x;

  vector<string> ans(t);
  for (int i = 0; i < t; i++) {
    auto v = n[i];
    while ((v & 1) != 0) {
      v >>= 1;
    }
    if (v == 0) ans[i] = "Bob";
    else ans[i] ="Alice";
  }

  for (auto &x: ans) cout << x << endl;

  return 0;
}