#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,i,j,k,z,n,count;
    
    cin>>t;
    
    for(j=0;j<t;j++)
    {   
      count=0;  
      cin>>n; 
      k=2;
        
      while(k<=n)
      { z=1;
        for(i=2;i<=k/2;i++)
        {
            if(k%i == 0)
            {   z = 0;
                break;
            }
        }
        if (z == 1)
        count++;
        k++;
      }
    
      if(count%2!=0) cout<<"Alice"<<endl;
      else           cout<<"Bob"<<endl;
    }
    return 0;
}