#include <bits/stdc++.h>
#define ll long long 
using namespace std;
vector <int> prime;
bool p[100005];
void sieve()
{   
    p[0]=1;
    p[1]=1;
    
    for(ll int i=2;i<=100001;i++)
    p[i]=0;
    
    prime.clear();
        
	for(ll int i=2;i*i<=100001;i++)
	{    
		if(p[i]==0)
		{   
			for(ll int j=i*i;j<=100001;j+=i)
			p[j]=1;
			
		}
		
	}
    ll int j=0;
	for(ll int i=1;i<100001;i++)
    {if(p[i]==0)
    {   j++;
        prime.push_back(j);
    }
    else
    prime.push_back(j);
    }
	
}

int main(){
   ll int g;
    cin >> g;
    sieve();
    for(ll int a0 = 0; a0 < g; a0++){
        {ll int n;
        cin >> n;
        if(prime[n-1]%2==0)
        cout<<"Bob\n";
        else
        cout<<"Alice\n";
        }
        // your code goes here
    }
    return 0;
}