#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 isprime(int n)
    {
    int i,ans=1;
    for(i=2;i<=n/2;i++)
        {
        if(n%i==0)
            {
            ans=0;
            break;
        }
    }
    return ans;
}
int main(){
    int g,i,count;
    char ans[1000][6];
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        // your code goes here
        if(n==1)
            strcpy(ans[a0],"Bob");
        else
            {
            count=0;
            for(i=2;i<=n;i++)
                {
                if(isprime(i)==1)
                    count++;
            }
            if(count%2==0)
                strcpy(ans[a0],"Bob");
            else
                strcpy(ans[a0],"Alice");
        }
    }
    for(i=0;i<g;i++)
        cout<<ans[i]<<endl;
    return 0;
}