#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;

void sieve(int n, int* prime) {
    int i,j;
    int *prime1 = (int*)malloc((n)*sizeof(int));
    prime1[1]=0;
    for (i=2;i<=n;i++)
        prime1[i]=1;
    for (i=2;i*i<=n;i++) {
        if (prime1[i]==1) {
            for(j=2*i;j<=n;j+=i) {
                prime1[j]=0;
            }
        }
    }
    int sum=0;
    
    for(i=1;i<=n;i++) {
        prime[i]=sum+prime1[i];
        sum+=prime1[i];
       // cout<<prime1[i]<<" "<<i<<" "<<prime[i]<<endl;
    }
}

int main(){
    int g;
    cin >> g;
    int max =0;
    vector<int> v;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        v.push_back(n);
        if (n>max) {
            max = n;
        }
        // your code goes here
    }
    int *prime = (int*)malloc((max+1)*sizeof(int));
    sieve(max, prime);
    int i,k;
    for(i=0;i<g;i++) {
       k= prime[v[i]];
      // cout<<k;
       if (k%2 ==0){
           cout<<"Bob\n";
       } else {
           cout<<"Alice\n";
       }
    }
    return 0;
}