#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 g;
    cin >> g;
    for(int x = 0; x < g; x++){
        int n;
        cin >> n;
        // your code goes here
        int c=0;
    for(int i=4;i<=n;i++)
      { int flag=0;
        for(int j=2;j<=sqrt(i);j++)
        { if(i%j==0)
        {  flag=1;
         break;}
       }
       if(!flag)
           c++;
        
    }
        
       if(n==2)
           cout<<"Alice"<<endl;
        else if(n==1)
            cout<<"Bob"<<endl;
            else if(n==3)
             cout<<"Bob"<<endl;
        else
        {if((c+2)%2!=0)
            cout<<"Alice"<<endl;
         else
             cout<<"Bob"<<endl;
    }
    }
        
    return 0;
}