#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 limit 100001
#define fr(i,beg,end) for(i=beg;i<end;i++)
#define rf(i,end,beg) for(i=end;i>beg;i--)
#define ll long long
#define pb push_back
#define MOD 1000000007
using namespace std;


int main(){
    bool s[limit];
    vector<int> v;
    int i = 0;
    fr(i,0,limit)
        s[i] = true;
    s[0] = false;
    s[1] = false;
    int count = 1;
    fr(i,2,limit)
        {
        if(s[i])
            {
            //mymap.insert(pair<int,int>(i,count));
            v.pb(i);
            count++;
            int j;
            for(j=2;j*i<=limit;j++)
                s[i*j] = false;
        }
    }
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        vector<int>::iterator num = std::lower_bound(v.begin(),v.end(),n+1);
        int c = num-v.begin();
        if(c&1)
            cout<<"Alice\n";
        else
            cout<<"Bob\n";
    }
    return 0;
}