#include <bits/stdc++.h>

#define REP(i, x, n) for(int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define F first
#define S second
#define mp make_pair

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;

map<int, bool> memo;

bool rec(int n) {
  if(n == 1) return false;
  
  if(memo.count(n)) return memo[n];
  
  bool res = false;
  int d = n;
  vector<int> pf;
  
  for(int i = 2; i * i <= d; i++) {
    if(d % i) continue;
    pf.push_back(i);
    while(d % i == 0) d /= i;
  }
  if(d != 1) pf.push_back(d);

  for(int i = 0; i < pf.size(); i++) {
    int tmp = n;
    while(tmp % pf[i] == 0) {
      tmp /= pf[i];
      res |= !rec(tmp);
    }
  }
  
  return memo[n] = res;
}

int main() {
  // ios_base::sync_with_stdio(false);
  int N;
  cin >> N;
  cout << (rec(N) ? "Alice" : "Bob") << endl;
  return 0;
}