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

bool prime[100005];

void calculate()
    {
    long long int i,j;
    prime[1]=false;
    for(i=2;i<=100005;++i)
        prime[i]=true;
    for(i=2;i<=sqrt(100005);++i)
        {
        if(prime[i])
            {
            for(j=2*i;j<=100005;j+=i)
                {
                prime[j]=false;
            }
        }
    }
}

long long int f[100001]={0};

void calculate1()
    {
    f[1]=0;
    long long int i;
    for(i=2;i<=100000;++i)
        {
        if(prime[i])
            {
            f[i]=f[i-1]+1;
        }
        else f[i]=f[i-1];
    }
}

int main(){
    long long int g,n;
    calculate();
    calculate1();
    cin>>g;
    while(g--)
        {
        cin>>n;
        if(f[n]%2!=0)
            {
            cout<<"Alice\n";
        }
        else cout<<"Bob\n";
    }
    return 0;
}