#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(){
        vector<pair<int, int> > prime;
        vector<bool> isPrime(100006, true);
        for(int i = 2; i <= 100006; i++){
            if(isPrime[i]){
                int cnt = 0;
                for(int j = 2 * i ; j <= 100006; j += i){
                    isPrime[j] = false;
                    cnt++;
                }
                prime.push_back(make_pair(i, cnt));
            }
        }
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        // your code goes here
        if(n == 1){
            cout << "Bob\n";
        }
        else {
            int ans = 0;
            for(int i = 0 ;; i++){
               if(prime[i].first > n)break;
                ans++;
            }
            //cout << ans << "\n";
            if(ans % 2 == 0){
                cout << "Bob\n";
            }
            else cout << "Alice\n";
    }
    
    }
    return 0;
}