#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;
unsigned long long int prime_cnt(unsigned long long int n1){n1++;
   unsigned long long int n=(n1-2)/2;
    int c=0;int arr[n+1];
    for( unsigned long long int i=1;i<=n;i++)
        arr[i]=0;
    for( unsigned long long int i=1;i<=n;i++){
        for( unsigned long long int j=i;(i+j+2*i*j)<=n;j++){
            arr[(i+j+2*i*j)]=1;
        }
    }
    for( unsigned long long int i=1;i<=n;i++){
        if(arr[i]==0)
            c++;
    }if(n1>2)
        c++;
    return c;
    
    
}

int main(){
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        // your code goes here
        long int c=prime_cnt(n);
        if(c%2==0)
            cout<<"Bob";
        else
            cout<<"Alice";
        cout<<endl;
    }
    return 0;
}