#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (ll i = (s); i < (ll)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (ll i = (ll)(s - 1); i >= (ll)(e); i--)
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

template <typename T, typename U>
bool chmax(T& a, const U& b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T, typename U>
bool chmin(T& a, const U& b) {
    if (a <= b) return false;
    a = b;
    return true;
}

void yes_no(bool f, string yes = "Yes", string no = "No") {
    cout << (f ? yes : no) << "\n";
}

using Facts = map<ll, int>;
void factrize(ll n, Facts& mp) {
    if (n < 2) return;
    ll m = sqrt(n);
    REP(i, 2, m + 1) {
        int cnt = 0;
        while (n % i == 0) {
            n /= i;
            ++cnt;
        }
        if (cnt != 0) mp[i] += cnt;
    }
    if (n != 1) mp[n]++;
}

void solve() {
    ll n;
    cin >> n;
    Facts f;
    factrize(n, f);
    map<ll, ll> g;
    ll nim = 0;
    for (auto&& [k, v] : f) {
        nim ^= v;
    }
    yes_no(nim == 0, "Bob", "Alice");
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    // multi-testcase
    // cin >> t;
    rep(ti, t) solve();
    return 0;
}