#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int t; cin >> t;
	/*{
		int n = 1000;
		vector<int>d(n + 1);
		d[1] = 0;
		rep2(i, 2, n + 1) {
			set<int>st;
			rep2(j, 1, i) {
				int k = i - j;
				st.insert(d[max(j, k)]);
			}
			rep(j, 10000000) {
				if (st.count(j))continue;
				d[i] = j;
				break;
			}
		}
		rep(i, 100) {
			if (d[i] == 0)		cout << i << " " << d[i] << endl;
		}
	}*/
	set<long long>st;
	{
		long long x = 1;
		while (x <= LINF) {
			st.insert(x);
			x = x * 2 + 1;
		}
	}
	while (t--) {
		long long n; cin >> n;
		if (st.count(n))cout << "Bob" << endl;
		else cout << "Alice" << endl;
	}
	return 0;
}