#include <iostream>
#include <string>
#include <vector>
#include <numeric>
#include <map>
#include <algorithm>
#include <set>
#include <queue>
#include <random>
using namespace std;

#define rep(i,m,n) for(int i=m; i<n; i++)
#define INF (1 << 30)

using ll = long long;
using ull = unsigned long long;

std::random_device rng;

//test

//erase leaves: std::iota, union_find
//swapping puzzle: std::next_permutation
//festival: lower_bound

int main()
{
    int n;
    cin >> n;
    int i = 1;
    vector<int> s;
    while (n!=1) {
        ++i;
        if (n % i != 0) continue;
        s.push_back(0);
        while (n % i == 0) {
            s.back()++;
            n /= i;
        }
    }

    int s_size = (int)s.size();
    int ans = s[0];
    rep(i, 1, s_size) {
        ans ^= s[i];
    }

    if (0 < ans) {
        cout << "Alice" << endl;
    }
    else {
        cout << "Bob" << endl;
    }

    return 0;
}