#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;
void SieveOfEratosthenes(int n,vector<long long> &prime)
{
   for (long long p=2; p*p<=n; p++)
    {
        if (prime[p] == true)
        {
            for (int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }
}
void call(vector<long long> &pre_compute,vector<long long> &prime)
    {
    long long count=0;
    for(long long i=1;i<=1000000;i++)
        {
        if(prime[i])
            {
            count++;
            pre_compute[i]=count;
        }else{
            pre_compute[i]=count;
        }
    }
  //  for(long long i=1;i<=1000000;i++)
    //     cout<< pre_compute[i]<<" ";
}

int main(){
    int g;
    cin >> g;
    vector<long long> pre_compute(1000001,0);
    vector<long long> prime(1000001,1);
    SieveOfEratosthenes(1000001,prime);
    prime[0] = 0;
    prime[1] = 0;
    prime[4] = 0;
    call(pre_compute,prime);
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        if(pre_compute[n]%2==0)
            cout<<"Bob\n";
        else
            cout<<"Alice\n";
    }
    return 0;
}