#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P =pair<int,int>;
#define rep(i,n) for(int i = 0;i < (n);i++)
ll INF = 1LL << 60;
int main(){
  int n;
  cin >> n;
  vector<int>primes;
  for(int i = 2;i*i <= n;i++){
    if(n%i == 0){
      int cnt = 0;
      while(n % i == 0){
        n /= i;cnt++;
      }
      primes.push_back(cnt);
    }
  }
  if(n != 1)primes.push_back(1);
  int nim = 0;
  rep(i,primes.size()){
    nim ^= primes[i];
  }
  if(nim != 0)cout << "Alice" << endl;
  else cout << "Bob" << endl;
  return 0;
}