#include<bits/stdc++.h>
#include<atcoder/all>
#define chmin(x,y) (x) = min((x),(y))
#define chmax(x,y) (x) = max((x),(y))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vec vector
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back 
#define eb emplace_back

using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
const ll mod = 998244353;
using mint = modint998244353;
const vector<int> dx = {1,0,-1,0}, dy = {0,1,0,-1};
// using Graph = vector<vector<pair<int,ll>>>;
using Graph = vector<vector<int>>;

int main(){
  // prep
  set<ll> st;
  for(int i = 1; i <= 60; i++)
    st.insert((1LL<<i) - 1);

  // input
  int T;
  cin >> T;
  while(T--){
    ll N;
    cin >> N;
    cout << (st.count(N) ? "Bob" : "Alice") << endl;
  }
  // solve
  
  // output
  
}