//################################################################
//################################################################
//####In the Name Of Allah,the Most Gracious,the Most Merciful.###
//######Created by Sazid Rahman  Simanto on 2/21/16.##############
//# Copyright © 2016 Sazid Rahman  Simanto. All rights reserved.##
//################################################################
//################################################################

#include<bits/stdc++.h>
using namespace std;
#define MSET(a,x) memset(a,x,sizeof a)
#define FOR(i,x,y) for(int i=(x);i<=(y);i++)
#define FORR(i,x,y) for(int i=(x);i<(y);i++)
#define ROF(i,x,y) for(int i=(y);i>=(x);i--)
#define SQ(x) ((x)*(x))
#define ALL(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define ff first
#define ss second
#define pb push_back
#define inf 1061109567
#define maxn 100001
#define esp 1e-8

typedef pair<int,int>ii;
typedef long long ll;
typedef vector<ii>vii;
typedef vector<int>vi;

int gcd(int a, int b){
        if(b == 0) return a;
	return gcd( b , a % b);
}
int lcm(int a, int b){
	return a *( b / gcd( a, b));

}

int posMod(int a, int m)
{
        return (( a % m) + m) % m;
}

int Set(int N, int pos) {return N = N | (1 << pos);}
int reset(int N, int pos) {return N = N & ~ (1 << pos);}
bool check(int N, int pos) {return (bool) (N & (1 << pos));}

//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);

//################################################################
//##    Template Ends Here……                        		##
//################################################################
int mark[100005];

int main()
{
        std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
        //freopen("output.txt", "w", stdout);
        int n, t;
        cin >> t;
        while(t--){

                cin >> n;

                if( n == 1){
                        cout << "Bob\n";
                        continue;
                }
                else{
                        MSET(mark, 0);
                        mark[1] = 1;
                        int limit = sqrt(n * 1.0) + 2;
                        bool al = true, bob = false;

                        for(int i = 4; i <= n; i += 2) mark[i] = 1;

                        for(int i = 3; i <= n; i += 2){

                                if(!mark[i]){
                                        if(!bob){
                                                bob = true;
                                                al = false;
                                        }
                                        else if(bob){
                                                al = true;
                                                bob = false;
                                        }
                                        if(i <= limit){
                                                for(int j = i * i; j <= n; j += i * 2) mark[j] = 1;
                                        }
                                }
                        }
                        if(al) cout <<"Alice\n";
                        else cout <<"Bob\n";
                        continue;
                }
        }
        return 0;
}