#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

#include <map>
map<long long, int> prime_factorize(long long n) {
    map<long long, int> res;
    for (long long p = 2; p * p <= n; ++p) {
        while (n % p == 0) { ++res[p]; n /= p; }
    }
    if (n != 1) res[n] = 1;
    return res;
}

int main() {
    int n; cin >> n;
    int nim = 0;
    for (auto &p: prime_factorize(n)) {
        nim ^= p.second;
    }
    cout << (nim ? "Alice" : "Bob") << endl;
    return 0;
}