#include<iostream> #include<algorithm> #include<vector> #include<queue> #include<map> #include<utility> #include<set> #include<stack> #include<list> #include<deque> #include<bitset> #include<iomanip> #include<cstring> #include<sstream> #include<cstdio> #include<cstdlib> #include<climits> #include<cmath> #include<cctype> #define pb push_back #define mp make_pair #define rep(i,a,b) for(int i=a;i<=b;i++) #define ren(i,a,b) for(int i=a;i>=b;i--) #define ff first #define ss second #define pll pair<long long int,long long int> #define pii pair<int,int> #define vll vector<long long int> #define vii vector<int> #define gi(n) scanf("%d",&n) #define gll(n) scanf("%lld",&n) #define gstr(n) scanf("%s",n) #define gl(n) cin >> n #define oi(n) printf("%d",n) #define oll(n) printf("%lld",n) #define ostr(n) printf("%s",n) #define ol(n) cout << n #define os cout<<" " #define on cout<<"\n" #define o2(a,b) cout<<a<<" "<<b #define all(n) n.begin(),n.end() #define present(s,x) (s.find(x) != s.end()) #define cpresent(s,x) (find(all(s),x) != s.end()) #define tr(container, it) for(__typeof(container.begin()) it = container.begin(); it != container.end(); it++) using namespace std; typedef unsigned long long int ull; typedef long long int ll; typedef vector<vector<ll> > mat; int pp[1000005]; int main() {ios_base::sync_with_stdio(false); int t; gl(t); pp[0]=pp[1]=1; rep(i,2,1000004) { if(pp[i]==1) continue; for(int j=2*i;j<=1000004;j+=i) pp[j]=1; } rep(i,0,1000004)pp[i]=1-pp[i]; rep(i,1,1000004)pp[i]+=pp[i-1]; while(t--) { int n; cin>>n; if(pp[n]%2)ol("Alice\n"); else ol("Bob\n"); } return 0; }