#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int getNumPrimeDivisors( int n )
{
    int count = 0;
    int f = 2;
    while( n > 1 )
    {
        if( n%f == 0 )
        {
            while( n%f == 0 )
                n = n/f;    
            count++;
        }    
        f++;
    }
    return count;
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    long int n;
    int x;
    cin >> n;
    
    while( n )
    {
        cin >> x;
        cout << ( getNumPrimeDivisors(x)%2 == 0 ? "Bob" : "Alice" );
        cout << std::endl;
        n--;    
    }    
    return 0;
}