#include #include #include template std::vector> prime_factorization(T n) { std::vector> res; for (T i = 2; i * i <= n; ++i) { if (n % i != 0) continue; int exponent = 0; while (n % i == 0) { ++exponent; n /= i; } res.emplace_back(i, exponent); } if (n != 1) res.emplace_back(n, 1); return res; } template bool nim(const std::vector &a) { long long x = 0; for (const T e : a) { x ^= e; } return x != 0; } int main() { int n; std::cin >> n; std::vector a; for (const std::pair &p : prime_factorization(n)) { a.emplace_back(p.second); } std::cout << (nim(a) ? "Alice\n" : "Bob\n"); return 0; }