#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 main(){
    int g;
    cin >> g;
    vector<bool> vals;
    vector<int> prim;
    bool flag = false;
    vals.push_back(false);
    vals.push_back(false);
    for(int i=2;i<100005;i++)
        {
        bool isPrim = true;
        for(int j=0;j<prim.size() && i/prim[j]>=prim[j];j++)
            {
            if(i%prim[j]==0)
                {
                isPrim=false;
                break;
            }
        }
        if(isPrim)
            {
            prim.push_back(i);
            flag=!flag;
        }
        vals.push_back(flag);
    }
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        if(vals[n])
            {
                        cout<<"Alice\n";
        }
        else
            {
            cout<<"Bob\n";
        }
    }
    return 0;
}