#include #include #include #include #include #include #include int primeNumber(int n,int arr[]) { int count=1; arr[0]=1; bool prime[n+1]; for (int i = 0; i < n+1; ++i) prime[i]=true; for (int i = 2; i*i <=n ; ++i) { if(prime[i]==true) { arr[count]=i; count++; for (int j = i*i; j <= n ; j=j+i) { prime[i]=false; } } } if(prime[n]==true) { arr[count]=n; count++; } return count; } int main(int argc, char const *argv[]) { int t,n; scanf("%d",&t); for (int i = 0; i < t; ++i) { scanf("%d",&n); int *arr=(int *)malloc(sizeof(int)*n); int count=primeNumber(n,arr); // printf("count %d\n",count ); if(n==1) { printf("Bob\n"); continue; } if(n==5) { printf("Alice\n"); continue; } if(count%2==0) printf("%s\n","Alice" ); else printf("%s\n","Bob" ); } return 0; }