#include <bits/stdc++.h>
using namespace std;
int cnt = 0;

int SieveOfEratosthenes(int n)
{
    // Create a boolean array "prime[0..n]" and initialize
    // all entries it as true. A value in prime[i] will
    // finally be false if i is Not a prime, else true.
    bool prime[n+1];
    memset(prime, true, sizeof(prime));

    for (int p=2; p*p<=n; p++)
    {
        // If prime[p] is not changed, then it is a prime
        if (prime[p] == true)
        {
            // Update all multiples of p
            for (int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }

    // Print all prime numbers
    for (int p=2; p<=n; p++)
     {  
        if (prime[p] == true)
          {
          cnt++;
          }
      }

      return cnt;
      
}


int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		int n;
		cin>>n;
		
	
		int result = 0;
		result = SieveOfEratosthenes(n);
    if( result%2 == 0)
    {
      cout<<"BOB"<<endl;
    }
    else
    {
      cout<<"ALICE"<<endl;
    }
		//cout<<result;
    cnt = 0;
	}

}