/* jai shree ram _/\_ A hacker from NITP */ #include using namespace std; #define mod 1000000007 typedef set ss; typedef vector vs; typedef map msi; typedef pair pa; typedef long long int ll; bool prime[100005]; int cnt[100005],n,i,j; int main() { //freopen("inputf.in", "r", stdin); //freopen("o.out", "w", stdout); ios_base::sync_with_stdio(false); cin.tie(0); int t; for(i=2;i<=100000;i++) prime[i]=1; for(i=2;i*i<=100000;i++) { if(prime[i]) { for(j=i*i;j<=100000;j+=i) prime[j]=0; } } for(i=2;i<=100000;i++) { cnt[i]=cnt[i-1]; if(prime[i]) cnt[i]++; } cin>>t; while(t--) { cin>>n; if(cnt[n]%2==0) cout<<"Bob\n"; else cout<<"Alice\n"; } return 0; }