#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,i,arr[100],ctr=2,p=0;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        // your code goes here
        for(i=1;i<=n;i++)
         arr[i-1]=i;
        if(n>2)
            {
        for(i=2;i<n;i++)
           {
            while(ctr<=n-2)
                {
                if(arr[i]%ctr==0)
                    break;
                else 
                    ctr++;
            }
            p++;
        }
            p++;}
        else if(n==2)
            p=n-1;
            else
            cout<<"Bob"<<endl;
        if(p>0)
            {
            if(p%2==0)
                {cout<<"Bob"<<endl;}
            else
                {cout<<"Alice"<<endl;}
        }
    }
    return 0;
}