#include <bits/stdc++.h>
#define FOR(v, a, b) for(int v = (a); v < (b); ++v)
#define FORE(v, a, b) for(int v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(int v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define LLI long long int
#define fst first
#define snd second
#ifdef DEBUG
#include <boost/core/demangle.hpp>
#define dump(x) cerr << "L" << __LINE__ << ": in " << __PRETTY_FUNCTION__ << " \e[32;1m" << boost::core::demangle(typeid(x).name()) << "\e[37m" << " " << (#x) << " = " << (x) << "\e[m" << endl;
#else
#define dump(x)
#endif
using namespace std;
template <typename T> using V = vector<T>;
template <typename T, typename U> using P = pair<T,U>;
template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}
template <typename T, typename U> istream& operator>>(istream &is, pair<T,U> &p){is >> p.first >> p.second; return is;}

template <typename T> ostream& operator<<(ostream &os, const vector<T> &v){os << "{";ITR(i,v){if(i!=v.begin())os << ","; os << *i;}os << "}"; return os;}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T,U> &p){os << "(" << p.first << "," << p.second << ")"; return os;}

template <typename T, typename U>
ostream& operator<<(ostream &os, const unordered_map<T,U> &m){
  os << "[";
  ITR(i,m){
    if(i!=m.begin()) os << ",";
    os << i->fst << "=>" << i->snd;
  }
  os << "]";
  return os;
}

template <typename T> T& chmin(T &a, const T &b){return a = min(a,b);}
template <typename T> T& chmax(T &a, const T &b){return a = max(a,b);}

vector<LLI> prime_factorize_unique(LLI n){
  vector<LLI> res;
  for(LLI i=2LL; i*i<=n; ++i){
    if(n%i == 0){
      res.push_back(i);
      while(n%i==0){
	n/=i;
      }
    }
  }
  if(n!=1) res.push_back(n);
  return res;
}

unordered_map<int,int> dp;
vector<LLI> primes;

int mex(vector<int> &v){
  sort(ALL(v));
  if(v[0] > 0) return 0;
  REP(i,v.size()-1){
    if(v[i+1] > v[i]+1) return v[i]+1;
  }
  return v.back()+1;
}


int func(int n){
  if(EXIST(dp,n)) return dp[n];
  if(n == 1) return dp[1] = 0;

  vector<int> g;
  
  for(auto p : primes){
    int t = n;

    while(t>1 && t%p==0){
      t /= p;
      g.push_back(func(t));
    }
  }

  int ret = mex(g);

  return dp[n] = ret;
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n; cin >> n;

  primes = prime_factorize_unique(n);
  dump(primes);

  func(n);

  dump(dp);

  if(dp[n]){
    cout << "Alice" << endl;
  }else{
    cout << "Bob" << endl;
  }
  
  return 0;
}