#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 t,i,j;
    cin >> t;
    for(i = 0; i< t; i++){
        int n;
        cin >> n;
        
        int a[n];
        for(j=1;j<=n;j++)
            a[j]=j;
        
        int k;
        int count=0;
        for(j=2;j<=n;j++)
            {
            if(a[j]==0)
                continue;
            else
                {
                for(k=3;k<=n;k++)
                    {
                    
                        
                    
                    if(k%j==0&&k!=j)
                      {
                        a[k]=0;
                        
                      
                    }}
            }
        }
        
        for(j=2;j<=n;j++)
            {
            if(a[j]!=0)
                count++;
        }
       
                
        
        if(count%2==0||count==0)
            cout << "Bob\n";
        else
            cout << "Alice\n";
    }
    return 0;
}