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

bool erased[10005];
vector<int> prime;


int main() {
    #ifdef DEBUG
        freopen("in.txt", "r", stdin);
    #endif
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    for (ll i = 2; i <= 10000; i++) {
        if (!erased[i]) {
            prime.push_back(i);
            for (ll j = i * 2; j <= 10000; j += i) {
                erased[j] = true;
            }
        }
    }

    ll n; cin >> n;

    ll over2cnt = 0;
    for (auto &p : prime) {
        if (n % p == 0) {
            int cnt = 0;
            // cout << p << ' ';
            while (n % p == 0) {
                n /= p;
                cnt++;
            }
            // cout << cnt << '\n';
            if (cnt >= 2) over2cnt++;
        }
    }

    if (over2cnt <= 1) cout << "Alice\n";
    else cout << "Bob\n";

    return 0;
}