#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 prime(int x){
    if(x==1)return 2;
    if(x==2)return 3;int total,t=0;
    for(int i=x+2;i<99999;i=i+2){
       // int t=0;
        for(int j=2;j<i;j++){
            if(i%j==0){t=1;break;}
        }
        if(t==1)continue;
        if(t==0){total=i;break;}
    }return total;
}


int main(){
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n,y=1,total=0;
        cin >> n;
        if(n==1){cout<<"Bob\n";continue;}
        vector<int>a(n);
        for(int i=0;i<n;i++)a[i]=i+1;
        int len=n;
            while(true){total++;
                int x=prime(y);
                for(int i=0;i<len;i++){
                    if(a[i]%x==0){a.erase(a.begin()+i,a.begin()+i+1);i--;len--;}
                }y=x;
                if(len==1)break;
            }
        if(total%2==0)cout<<"Bob\n";
        else cout<<"Alice\n";
        // your code goes here
    }
    return 0;
}