#include <iostream>
#include <map>
using namespace std;

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

int N;

int main() {
    cin >> N;

    map<int, int> factors = PrimeFactorization(N);
    int x = 0;
    for (auto it = factors.begin(); it != factors.end(); it++) {
        x ^= it->second;
    }
    if (x != 0) cout << "Alice" << endl;
    else cout << "Bob" << endl;

    return 0;
}