#include using namespace std; void GetPrimes(int N, vector &p) { int c = 1; while (c < N) { c++; bool flag = true; int d = (int)sqrt(c); for(int i = 0; i < p.size(); i++) { if(c % p[i] == 0) { flag = false; break; } if (d < p[i]) break; } if(flag) p.push_back(c); } } int64_t Factorize(int64_t N, const vector &p, vector &v) { if(p.back() < sqrt(N)) return -1; for(int i = 0; N != 1 && i < p.size(); i++) { v.push_back(0); while(N % p[i] == 0) { N /= p[i]; v[i]++; } } return N; } int main() { #ifdef DEBUG std::ifstream in("/home/share/inputf.in"); std::cin.rdbuf(in.rdbuf()); #endif auto v = vector(); auto p = vector(); int N; cin >> N; GetPrimes(1e6, p); Factorize(N, p, v); int ans = 0; for(int i = 0; i < v.size(); i++) { ans ^= v[i]; } cout << (ans ? "Alice" : "Bob") << endl; return 0; }