#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

long findPrimes(long n)
{
    vector<long> primes;
    vector<bool> sieve(n+1, true);
    long sn = sqrt(n);
        
    for (int p=2; p <= sn; p++)
    {
        if (sieve[p])
        {
            for (int i=p*2; i<=n; i += p)
                sieve[i] = false;
        }
    }
 
    for (int p=2; p<=n; p++)
    {
        if (sieve[p])
        {
            primes.push_back(p);
        }
    }
    
    return primes.size();
}

int main()
{
    int g;
    cin >> g;
    
    for(int a0 = 0; a0 < g; a0++)
    {
        int n;
        cin >> n;
        
        if (findPrimes(n) % 2 == 1)
            cout << "Alice" << endl;
        else
            cout << "Bob" << endl;
    }
    
    return 0;
}