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