#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>
#define ll long long
using namespace std;

long long fix[1000001],k;
int main(){
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin>>n;
        k=0;
        
        for (ll i=1;i<=n;i++){
            fix[i]=0;
        }
        
        for (ll i=2;i<=n;i++){
            if (fix[i]==0){
                k++;
                for (ll j=i*i;j<=n;j+=i){
                    fix[j]=1;
                }
            }
        }
        if (k%2==1) cout<<"Alice"<<endl;
            else cout<<"Bob"<<endl;
    }
    return 0;
}