#include <bits/stdc++.h>

using namespace std;

#define MAX 100005
#define lli long long int
map<lli, lli> count_primes;

lli a[MAX];

lli flag[MAX];

int main()
{
  for(lli i=0; i<MAX; i++)
  {
    flag[i] = 0;
  }
  count_primes[0] = 0;
  count_primes[1] = 0;
  a[0] = 0;
  a[1] = 0;
  for(lli i=2; i<MAX; i++)
  {
    if(flag[i]==0)
    {
      count_primes[i]++;
      a[i] = a[i-1]+1;
      for(lli j=i+i; j<MAX; j+=i)
      {
        flag[j] = 1;
      }
    }
    else
    {
      a[i] = a[i-1];
    }
  }
  
  lli g;
  cin>>g;
  while(g--)
  {
    lli n;
    cin>>n;
    lli val = a[n];
    if(val%2==0)
    {
      cout<<"Bob"<<endl;
    }
    else
    {
      cout<<"Alice"<<endl;
    }
  }
  return 0;
}