#include <bits/stdc++.h>

using u64 = std::uint64_t;

std::map<u64, u64> prime_factor(u64 n) {
    std::map<u64, u64> ret;
    for (u64 u = 2; u * u <= n; u++) {
        while (n % u == 0) {
            ret[u]++;
            n /= u;
        }
    }
    if (n != 1) ret[n] = 1;
    return ret;
}


int main() {
    using namespace std;
    u64 N;
    cin >> N;
    map<u64, u64> primes = prime_factor(N);
    u64 nim = 0;
    for (auto it : primes) {
        nim ^= it.second;
    }
    cout << (nim ? "Alice" : "Bob") << endl;
}