#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;

vector<pair<ll, ll>> prime_factor(ll n) {
    vector<pair<ll, ll>> pf;
    for (ll i = 2; i * i <= n; i++) {
        if (n % i != 0) continue;
        ll e = 0;
        while (n % i == 0) {
            e++;
            n /= i;
        }
        pf.push_back({i, e});
    }
    if (n != 1) pf.push_back({n, 1});
    return pf;
}

int main() {
    ll n;
    cin >> n;
    vector<pair<ll, ll>> pf = prime_factor(n);
    int xor_sum = 0;
    for (auto x : pf) {
        xor_sum ^= x.second;
    }
    if (xor_sum != 0) cout << "Alice" << endl;
    else cout << "Bob" << endl;
}