#include <iostream>
#include <map>

using namespace std;

map<long long, int> prime_factor(long long n) {
    map<long long, int> ret;
    for (long long i = 2; i * i <= n; i++) {
        while (n % i == 0) {
            ret[i]++;
            n /= i;
        }
    }
    if (n != 1) ret[n] = 1;
    return ret;
}

int main() {
    int n;
    cin >> n;
    auto ma = prime_factor(n);
    int ret = 0;
    for (auto x:ma)ret ^= x.second;
    cout << (ret == 0 ? "Bob" : "Alice") << endl;
    return 0;
}