#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>
#define ll long long int
using namespace std;
int isprime(ll N){
    if(N<2 || (!(N&1) && N!=2))
        return 0;
    for(int i=3; i*i<=N; i+=2){
        if(!(N%i))
            return 0;
    }
    return 1;
}

int main(){
    int g;
    cin >> g;
    vector<ll>v;
   for(ll i=2;i<=100000;i++)
       {
       int val=isprime(i);
       if(val==1)
           v.push_back(i);
   }
    while(g--)
        {
        ll n;
        cin>>n;
        //cout<<n;
        ll count=0;
        for(ll i=0;i<100000;i++)
            {
           if(v[i]<=n)
               {
               count++;
           }
            else if(v[i]>n)
                break;
           
        }
        //cout<<count<<endl;
        if(count%2==0)
            cout<<"Bob"<<endl;
        else
            cout<<"Alice"<<endl;
    }
    return 0;
}