//Giorgi Kldiashvili && Saba Tavdgiridze

#include <bits/stdc++.h>

#define M 1000000007LL
#define ll long long
#define pb push_back

using namespace std;

bool check(int n)
{
  for(int i = 2; i * i <= n; ++ i)
    if(n % i == 0)
      return false;

  return true;
}

int n, testcase;
vector < int > A;

int main()
{

  for(int i = 2; i <= 1e5; ++ i)
    if(check(i))
      A.push_back(i);

  scanf("%d", &testcase);

  while(testcase --)
  {
    scanf("%d", &n);

    int s = upper_bound(A.begin(), A.end(), n) - A.begin();
    s = s % 2;
    if(s == 1)
    {
      printf("Alice\n");
    } else
    {
      printf("Bob\n");
    }
  }

}