#include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define endl '\n' #define all(v) (v).begin(), (v).end() #define uniq(v) (v).erase(unique((v).begin(), (v).end()), (v).end()) typedef long long ll; typedef pair P; typedef unsigned int uint; const int inf = 1000000009; map prime_factor(int n) { map res; for (int i = 2; i * i <= n; i++) { while (n % i == 0) { res[i]++; n /= i; } } if (n != 1) res[n] = 1; return res; } bool solve(int n) { map pf = prime_factor(n); int x = 0; for (auto& kv : pf) { x ^= kv.second; } return x != 0; } int main() { int n; scanf("%d", &n); printf("%s\n", solve(n) ? "Alice" : "Bob"); }