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

typedef long long ll;

vector<ll> primes;
map<ll, bool> memo[2];

void findPrimeFactors(ll n) {
    ll temp = n;
    for (ll i = 2; i * i <= temp; i++) {
        if (temp % i == 0) {
            primes.push_back(i);
            while (temp % i == 0) temp /= i;
        }
    }
    if (temp > 1) primes.push_back(temp);
}

bool canWin(int turn, ll num) {
    if (memo[turn].count(num)) return memo[turn][num];
    if (num == 1) return turn == 1;

    if (turn == 0) {
        for (ll p : primes) {
            if (num % p != 0) continue;
            ll nextNum = num;
            while (nextNum % p == 0) {
                nextNum /= p;
                if (canWin(1, nextNum)) return memo[turn][num] = true;
            }
        }
        return memo[turn][num] = false;
    } else {
        for (ll p : primes) {
            if (num % p != 0) continue;
            ll nextNum = num;
            while (nextNum % p == 0) {
                nextNum /= p;
                if (!canWin(0, nextNum)) return memo[turn][num] = false;
            }
        }
        return memo[turn][num] = true;
    }
}

int main() {
    ll n;
    cin >> n;
    findPrimeFactors(n);
    cout << (canWin(0, n) ? "Alice" : "Bob") << endl;
    return 0;
}