#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;

map<int,int> factorize(int x){
  map<int,int> ret;
  int d, q;
  while(x>=4 && x%2==0){ret[2]++; x/=2;}
  d = 3; q = x/d;
  while(q>=d){
    if(x%d==0){ ret[d]++; x=q; }else{ d+=2; }
    q=x/d;
  }
  ret[x]++;
  return ret;
}

map<int,int> memo;

int solve(int N){
  if(memo.count(N) > 0) return memo[N];
  map<int,int> fact = factorize(N);

  int ret = 0;
  FOR(it,fact){
    int tmp = 1;
    REP(i,1,it->second+1){
      tmp *= it->first;
      int res = solve(N/tmp);
      if(res == 0) ret = 1;
    }
  }
  return memo[N] = ret;
}

int main(){
  int N;
  cin >> N;
  memo[1] = 0;
  solve(N);

  if(memo[N] > 0) cout << "Alice" << endl;
  else cout << "Bob" << endl;
  
  return 0;
}