#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;

#define MAX 1000000
int a[MAX+5]={0};
vector<int> v;
void seive_prime()
{
    long long i,j;
    for(i=4;i<MAX;i=i+2)
    a[i]=1;
    v.push_back(2);
    a[2]=0;
    for(i=3;i<MAX;i=i+2)
    {
        if(a[i]==0){
            v.push_back(i);
            //printf("%d ",i);
            for(j=i;j*i<MAX;j=j+2)
               {
                    if(a[j*i]==0)
                    {
                        a[j*i]=1;
                    }
               }
            }
    }
}
int sum[1000006];
int main(){
    int g,i;
    seive_prime();
    for(i=2;i<1000005;i++)
        {
        if(a[i]==0)
            sum[i]=sum[i-1]+1;
        else
            sum[i]=sum[i-1];
    }
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        //printf("%d\n",sum[n]);
        if(sum[n]%2==1)
            printf("Alice\n");
        else
            printf("Bob\n");
        // your code goes here
    }
    return 0;
}