#include<bits/stdc++.h>
using namespace std;

#define pb push_back
#define ui unsigned int
#define ll long long
#define ull unsigned long long
#define rev(v) reverse(v.begin(),v.end())
#define FOR(a,b) for(int i = (a); i <= (b); ++i)
#define FORD(a,b) for(int i = (a); i >= (b); --i)
#define rev(v) reverse(v.begin(),v.end())
#define sort3(ARR,n) sort(ARR,ARR+n,less<long int>())
#define sort4(ARR,n) sort(ARR,ARR+n,greater<long int>())
#define asort(v) sort(v.begin(),v.end(),less<long int>())
#define desort(v) sort(v.begin(),v.end(),greater<long int>())
#define display(shaan) for (std::vector<int>::const_iterator i = shaan.begin(); i != shaan.end(); ++i) std::cout << *i << ' ';
#define fastScan ios_base::sync_with_stdio(0); cin.tie(NULL);
#define sz(v) (int)v.size();

vector< vector<int> >v;


int SV(int n)
{
    
    bool prime[n+1];
    memset(prime, true, sizeof(prime-1));
 
    for (int p=2; p*p<=n; p++)
    {
        if (prime[p] == true)
        {
            // Update all multiples of p
            for (int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }
 
    // Count all prime numbers
    int count=0;
    for (int p=2; p<=n; p++)
       if (prime[p])
          count++;
    return count;
}

int main()
{
    fastScan;
    int t,num,ans;
    cin>>t;
    while(t--){
        cin>>num;
        ans=SV(num);
        if(ans%2)
        cout<<"Alice"<<endl;
        else
        cout<<"Bob"<<endl;
    }

    return 0;
}
//yo freaker, don't be a tatti seeker :P

// sys/resource rlimit l limit search