#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define mt make_tuple
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;

map <int,int> res;

void prime_factor(int mynum){

  for(int i = 2; i*i <= mynum; i++){
    while(mynum % i == 0){
      ++res[i];
      mynum /= i;
    }
  }
  if(mynum != 1){
    res[mynum] = 1;
  }
}
map <vector <int>,bool> memo;
bool dfs(vector <int> nums){
  if(find_if_not(ALL(nums),[](int i){return i == 0;}) == nums.end()){
    return false;
  }
  bool OK = false;
  rep(i,sz(nums)){
    if(nums[i] != 0){
      int tmp = nums[i];
      for(int j = 0;j <= tmp-1;j++){
        nums[i] = j;
        if(!dfs(nums)){
          OK = true;
          goto result;
        }
      }
      nums[i] = tmp;
    }
  }
 result:
  memo[nums] = OK;
  return OK;
}


int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  int N;
  cin >> N;
  prime_factor(N);
  vector <int> nums;
  foreach(it,res){
    nums.pb(it->sec);
  }

  if(dfs(nums)){
    cout << "Alice\n";
  }else{
    cout << "Bob\n";
  }
  return 0;
}