#include using namespace std; void SieveOfEratosthenes(int n) { bool prime[n+1]; memset(prime, true, sizeof(prime)); for (int p=2; p*p<=n; p++) { if (prime[p] == true) { for (int i=p*2; i<=n; i += p) prime[i] = false; } } int ans=0; for (int p=2; p<=n; p++){ if (prime[p]) ans++; } if(ans%2==0) cout<<"Bob\n"; else cout<<"Alice\n"; } int main() { int n; cin>>n; for(int i=0;i>a; SieveOfEratosthenes(a); } return 0; }