/*
       _ _              ___ _____ ___   __   
__   _(_) | ____ _ ___ / _ \___  / _ \ / /_  
\ \ / / | |/ / _` / __| | | | / / | | | '_ \ 
 \ V /| |   < (_| \__ \ |_| |/ /| |_| | (_) |
  \_/ |_|_|\_\__,_|___/\___//_/  \___/ \___/ 
                                             
 VIKAS SINGH */
        
#include<bits/stdc++.h>
#define endl "\n"
#define pb push_back
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef std::vector<int> vi;
typedef std::vector<long long> vl;
#define f(a,b,c)                for(int a=b;a<c;a++)
#define s(x)                    scanf("%d",&x);
#define sl(x)                   scanf("%lld",&x);
#define s1d(a,n)                for(int ix=0;ix<n;ix++) cin>>a[ix];
#define p(x)                    printf("%d\n",x);
#define pl(x)                   printf("%lld\n",x);
#define p1d(a,n)                for(int ix=0;ix<n;ix++) printf("%d ",a[ix]); printf("\n");
#define p2d(a,n,m)              for(int ix=0;ix<n;ix++){ for(int jx=0;jx<m;jx++) printf("%d ",a[ix][jx]); printf("\n");}
#define MAX 1000005
#define MOD 1000000007

using namespace std;

bool isPrime(int n){
        if(n<=1)
          return false;
        if(n<=3)
          return true;
        if(!(n%2 and n%3))
          return false;
          int c = int(sqrt(n)+1e-7);
        for(int i=5;i<=c;i+=6){
            if(!(n%i and n%(i+2)))
               return false;
          }
          return true;
}


int main(){
  //  freopen("input.in","r",stdin);
  //  freopen("output.out","w",stdout);
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    vi v;
    int a[100005]={0};
    for (int i = 1; i < 100005; ++i)
    {   if(isPrime(i)){
        v.push_back(i);
        }
        a[i]= v.size();
    }

    int t;
    cin>>t;
    while(t--) {
        int n;
        cin>>n;
        if(a[n]%2==0){
            cout<<"Bob\n";
        }else{
            cout<<"Alice\n";
        }

    }
    
}