// // main.cpp // Q18 // // Created by AkihiroKOBAYASHI on 7/15/15. // Copyright (c) 2015 Akhr5884. All rights reserved. // #include #include int main(int argc, const char * argv[]) { int a, n, i, j; int count[10000] = {0}; int countnumber[10000] = {0}; int nim = -1; std::cin >> n; a = (int)(sqrt(n)) + 1; for(i = 2; i <= a; i++) { count[i] = 1; } // sosu for(i = 2; i <= a; i++) { if(count[i] == 1) { for(j = i; j * i <= a; j++) { count[i*j] = 0; } } } // wareru for(i = 2; i <= a; i++) { if(count[i] == 1 && n % i != 0) { count[i] = 0; } } j = n; for(i = 2; i <=a; i++) { if(count[i] == 1 && j%i == 0) { while(j%i == 0) { countnumber[i]++; j = j/i; } if(nim == -1) { nim = countnumber[i]; } else { nim = nim ^ countnumber[i]; } } } // 指定した数自身が素数なら勝利 if(j != 1 || nim != 0) { std::cout << "Alice\n"; } else { std::cout << "Bob\n"; } return 0; }