#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;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        // your code goes here
        if(n==1 || n==3)
            cout<<"Bob"<<endl;
        else if(n==2)
            cout<<"Alice"<<endl;
        else{
            int count=0;
            for(int j=1;j<=n;j++){
                if(j%2==0)
                    continue;
                else{
                    int flag=1;
        for(int i=2;i<=j/i;i++)
            {
            if(j%i==0)
                {
                flag=0;
                break;
            }
        }
                    if(flag==1)
                        count++;
                }
            }
            if(count%2==0)
                cout<<"Bob"<<endl;
            else
                cout<<"Alice"<<endl;
        }
    }
    return 0;
}