#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 9;
int prime[N];
int main()
 {
   
    for(int i = 2 ; i < N ; i++ )prime[i] = 1;
    for(int i = 2 ; i*i < N ; i++ )
        if(prime[i])
            for(int j = i + i ; j < N ; j+= i)
                  prime[j] = 0;
        
    for(int i = 2 ; i < N ; i++ )
             prime[i] += prime[i-1];
        int t,n;
    cin >> t;
    while(t--)
    {
         cin >> n;
        cout << ( prime[n]%2 == 1 ? "Alice" : "Bob" ) << endl;       
    }
    return 0;
}