#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
#define al(a) a.begin(), a.end()
#define ral(a) a.rbegin(), a.rend()
#define sz(a) (int)a.size()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define db(a, b) cout << #a << ": " << a << " " << #b << ": " << b << endl;

int main() {
  ll n;
  cin >> n;

  vector<int> ls;
  for (ll i = 2; i * i <= n; ++i) {
    if (n % i) continue;
    int e = 0;
    while (n % i == 0) {
      n /= i;
      e++;
    }
    ls.push_back(e);
  }
  if (n != 1) ls.push_back(1);

  int x = 0;
  for (auto e : ls) { x ^= e; }

  if (x)
    cout << "Alice" << endl;
  else
    cout << "Bob" << endl;
  return 0;
}