#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <unordered_set>

int main() 
{
    int game;
    std::cin >> game;
    
    for(int i = 0; i < game; i++)
    {
        int num = 0;
        std::cin >> num;

        std::unordered_set<int> notPrimes;
        std::vector<int> primes;
        
        for(int j = 2; j <= num; j++)
        {
            if(notPrimes.find(j) == notPrimes.end())
            {
                primes.push_back(j);
                
                for(int k = 2*j; k <= num; k += j)
                {
                    notPrimes.insert(k);
                }
            }
        }
                
        if((primes.size()) % 2 == 0)
        {
            std::cout << "Bob" << std::endl;
        }
        else
        {
            std::cout << "Alice" << std::endl;
        }
    }
    
    return 0;
}