#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef vector vi; typedef pair ii; #define fill(a,x) memset(a,x,sizeof(a)) #define pb push_back #define sz(x) (int)x.size() #define all(x) x.begin(),x.end() #define F first #define S second #define FOR(i,a,b) for(int i = a; i<=b; ++i) #define NFOR(i,a,b) for(int i = a; i>=b; --i) #define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0) const ll INF = 1e18; const int mod = 1e9+7; const int N = 1e5+10; vector pf(N); vi lol(N); void PRIMES(int n){ for(int i = 1; i< n ; ++i)pf[i] = i; for(int i = 2; i*i < N; i++){ if(pf[i] == i){ for(int j = i*i ; j < N; j+=i ){ pf[j] = i; } } } } int main(){ fast; PRIMES(N); FOR(i,2,N-1){ lol[i] = lol[i-1] + (pf[i]==i); } int t;cin >> t; while(t--){ int n; cin >> n; int c = lol[n]; if(!(c&1))cout << "Bob\n"; else cout << "Alice\n"; } return 0; }