#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,c=0,count,i;
    cin >> g;
    for(int a = 0; a < g; a++){
        int n;c=0;
        cin >> n;
        while(n!=0)
            {
            count=0;
            for(i=2;i<n;i++)
                {
                if(n%i==0)
                    count++;
            }
            if(count==0)
                c++;
            n--;
        }
        if(c%2!=0)
            cout<<"Bob"<<endl;
        else
            cout<<"Alice"<<endl;
        
        // your code goes here
    }
    return 0;
}