#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <forward_list>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef bitset<16> BS;
struct edge {
    int to, cost, id;
};
const ll MOD = 1E+09 + 7; // =998244353;
const ll INF = 1E18;
const int MAX_N = 1E+05;

ll dx[4] = { -1, 1, 0, 0 }, dy[4] = { 0, 0, -1, 1 };

ll N;

map<ll, ll> prime_factor(ll n);
ll power(ll x, ll a);
ll grundy(map<ll, ll> mp);

map<ll, ll> G;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> N;

    auto mp = prime_factor(N);
    ll g = grundy(mp);

    /*
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            cout << "i = " << i << ", j = " << j << ", dp = " << dp[i][j] << "\n";
        }
    }
    */

    if (g > 0) {
        cout << "Alice\n";
    } else {
        cout << "Bob\n";
    }

    return 0;
}

map<ll, ll> prime_factor(ll n)
{
    map<ll, ll> mp;
    for (ll i = 2; i * i <= n; i++) {
        while (n % i == 0) {
            mp[i]++;
            n /= i;
        }
    }
    if (n != 1)
        mp[n] = 1;
    return mp;
}

ll grundy(map<ll, ll> mp)
{
    ll p = 1;
    for (auto pp : mp) {
        p *= power(pp.first, pp.second);
    }
    if (p == 1)
        return G[p] = 0;
    if (G.count(p))
        return G[p];
    ll res = INF;
    for (auto pp : mp) {
        ll e = pp.second - 1;
        while (e >= 0) {
            map<ll, ll> mmp(mp);
            mmp[pp.first] = e;
            res = min(res, grundy(mmp));
            e--;
        }
    }
    //cout << "p = " << p << ", res = " << res << "\n";
    return G[p] = (res == 0 ? 1 : 0);
}

ll power(ll x, ll a)
{
    ll ans = 1;
    while (a > 0) {
        if (a & 1) {
            ans = ans * x;
        }
        x = x * x;
        a >>= 1;
    }
    return ans;
}