#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;
int solve(vector<int> &v,int n)
    {
    int l=0,mid,h=v.size()-1;
    while(l<=h)
        {
        mid=(l+h)/2;
        if(n>v[mid])
            l=mid+1;
        else if(n<v[mid])
            h=mid-1;
        else
            return mid+1;        
    }
    if(v[mid]<n)
       return mid+1;
   // else if(v[mid]>n)
        return mid;
}
#define lim 100000
int main(){
    int i,j;
    vector<int> v;
    int p[lim+1]={0};
    p[1]=1;
    for(i=4;i<=lim;i+=2)
        p[i]=1;
    for(i=3;i*i<=lim;i+=2)
        {
        if(p[i])continue;
        j=i*i;
        while(j<=lim)
            {
            p[j]=1;
            j=j+i;
        }
    }
    for(i=2;i<=lim;i++)
        if(p[i]==0)
        v.push_back(i);
/*  for(i=0;i<10;i++)
        cout<<v[i];
        cout<<endl;*/
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        // your code goes here
        if(n==1)
            cout<<"Bob"<<endl;
        else cout<<(solve(v,n)%2?"Alice":"Bob")<<endl;
    }
    return 0;
}