#include <iostream>
#include <set>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;

int dp[100000];
int f(int n) {
	if (n == 1) return 0;
	if (dp[n] != -1) return dp[n];

	set<int> st;
	for (int i = 1; i <= n / 2; i++) {
		st.insert(f(n - i));
	}

	int g;
	for (g = 0; st.find(g) != st.end(); g++);
	return dp[n] = g;
}

signed main() {
	int T;
	cin >> T;
	while (T--) {
		int n; cin >> n;
		
		bool second = false;
		for (int i = 0; i < 60; i++) {
			if ((1LL << i) - 1 == n) { second = true; break; }
		}
		if (second) { cout << "Bob" << endl; }
		else { cout << "Alice" << endl; }
	}
	return 0;
}