#include <bits/stdc++.h>
using namespace std;

vector<pair<long long, long long>> prime_factorize(long long n) {
    vector<pair<long long, long long>> res;
    for (long long a = 2; a * a <= n; a++) {
        if (n % a != 0) continue;
        long long ex = 0;
        while (n % a == 0) {
            ex++;
            n /= a;
        }
        res.push_back({a, ex});
    }
    if (n != 1) res.push_back({n, 1});
    return res;
}

int main() {
    long long N, xor_sum = 0;
    cin >> N;
    auto vp = prime_factorize(N);
    for (const auto p : vp) {
        xor_sum ^= p.second;
    }
    cout << (xor_sum ? "Alice" : "Bob") << endl;
}