#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 t;
  cin >> t;
  std::vector<int> v (100000 + 1, 1);
  v[0] = v[1] = 0;
  while (t--){
    int limit;
    cin >> limit;
    int sqrt = std::sqrt(limit);
    

    int count = 0;
    for(int i = 2; i <= sqrt; i++){
      if(v[i] == 1){
        count++;
        for(int j = i+1; j <= limit; j++){
          if(j % i == 0){
            v[j] = 0;
          }
        }
      }
    }
    for(int i = sqrt + 1; i <= limit; i++){
      if(v[i] == 1)
        count++;
    }
    if (count%2 == 0)
      cout << "Bob" << "\n";
    else 
      cout << "Alice" << "\n";
  }
  return 0;
}