#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;

ll N;

int main(void) {
  cin >> N;

  const ll SIZE = 100000;
  vector<bool> p(SIZE, true);
  p[0] = p[1] = false;
  REP(i, 0, SIZE) if(p[i]) for(ll j = i + i; j < SIZE; j += i) p[j] = false;
  vector<ll> prime;
  REP(i, 0, SIZE) if(p[i]) prime.push_back(i);

  vector<ll> num;
  for(ll i : prime) {
    if(N % i == 0) {
      ll cnt = 0;
      while(N % i == 0) cnt++, N /= i;
      num.push_back(cnt);
    }
  }
  if(N > 1) num.push_back(1);

  ll x = 0;
  for(ll i : num) x = x ^ i;
  cout << (x != 0 ? "Alice" : "Bob") << endl;
}