#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;

const ll INF = 1LL << 60;

vector<pair<ll, ll>> prime_factorize(ll n) {
    vector<pair<ll, ll>> res;
    for (ll p = 2; p * p <= n; ++p) {
        if (n % p != 0) continue;
        int num = 0;
        while (n % p == 0) { ++num; n /= p; }
        res.push_back(make_pair(p, num));
    }
    if (n != 1) res.push_back(make_pair(n, 1));
    return res;
}

ll N;
int main() {
    cin >> N;
    vector<P> v = prime_factorize(N);

    ll ans = v[0].second;
    for (int i = 1; i < v.size(); i++) {
        /// cout << v[i].first << " " << v[i].second << endl;
        ans ^= v[i].second;
    }

    if (ans != 0) {
        cout << "Alice" << endl;
    } else {
        cout << "Bob" << endl;
    }
}