#include <bits/stdc++.h>
using namespace std;

// 素因数分解 map<素因数, 個数>
// Tの型は整数型(int64_t推奨)
template <typename T> map<T, T> prime_factor(T n)
{
  map<T, T> ret;
  for(T i = 2; i * i <= n; i++)
  {
    T count = 0;
    while(n % i == 0)
    {
      count++;
      n /= i;
    }
    
    ret[i] = count;
    if(n == 0) break;
  }
  
  if(n != 1) ret[n] = 1;
  return ret;
}

int main()
{
  int N;
  cin >> N;
  
  map<int, int> pf = prime_factor<int>(N);
  int grundy = 0;
  for(pair<int, int> p : pf) grundy ^= p.second;
  if(grundy > 0) cout << "Alice" << endl;
  else cout << "Bob" << endl;
  return 0;
}