#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 a= 0; a< g; a++)
    {
        int n;
        cin >> n;
           int arr[n+1]={0};
            arr[0]=arr[1]=1;
        int i=0,j=0;
        for(i=2;i*i<=n;i++)
            {for(j=2*i;j<=n;)
            {arr[j]=1;j+=i;}
            }
    
    i=0;int cnt=0;
    while(i<=n)
    {
        if(arr[i]==0)
            cnt++;
        i++;
    }//cout<<cnt;
        if(cnt%2==0)
            cout<<"Bob\n";
        else
            cout<<"Alice\n";
    }
    return 0;
}