#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;

#define REP(i, init, n) for(int i = (int)(init); i < (int)(n); i++)

#define vi vector<int>
#define vl vector<long>
#define vvi vector<vector<int>>
#define vvl vector<vector<long>>
#define pint pair<int, int>
#define plong pair<long, long>

int N;

void solve() {
    map<int, int> M;
    int i = 2;
    int n = N;
    while(n > 1) {
        if(n % i == 0) {
            M[i]++;
            n /= i;
        } else {
            i += 1;
        }
        if(i * i > n) {
            M[n]++;
            break;
        }
    }
    int grundy = 0;
    for(pint p: M) {
        // cout << p.second << endl;
        grundy ^= p.second;
    }
    string ans = "";
    if(grundy != 0) ans = "Alice";
    else ans = "Bob";
    cout << ans << endl;
}

int main() {
    cin >> N;
    solve();
}