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

#define M 100007

bool marked[M];
int A[M];

void sieve(int n) {
  memset(marked, 0, sizeof(marked));
  int x = 0;
  A[0] = A[1] = 0;
  for (int i = 2; i < n; i++) {
    if (marked[i] == false) { // i is a prime
      A[i] = ++x;
      for (int j = i + i; j < n; j += i) {
        marked[j] = true;
      }
    } else {
        A[i] = A[i-1];
    }
  }
}



int main(){
    sieve(M);
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        // your code goes her
        if(A[n]%2==0) puts("Bob");
        else puts("Alice");
    }
    return 0;
}