#include #include #include #include #include #include #include #include #include #include using namespace std; map prime; void prime_factor(long long n){ long long m = n; if (n % 2 == 0){ while(n % 2 == 0){ prime[2]++; n /= 2; } } for (long long i = 3; i*i <= m; i+=2){ if (n % i == 0){ while(n % i == 0){ prime[i]++; n /= i; } } } if (n != 1){ prime[n]++; } } int main(){ long long N, X=0; cin >> N; prime_factor(N); for (auto [x, y] : prime) X ^= y; cout << (X != 0 ? "Alice" : "Bob") << endl; return 0; }