#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>


using namespace std;
using LL = long long;
using LD = long double;


#define ALL(v) begin(v), end(v)
#define REP(i, n) for (LL i = 0; (i) < (LL)(n); ++(i))
#define REPR(i, n) for (LL i = (LL)(n)-1; (i) >= 0; --(i))
#define REP2(i, n, m) for (LL i = (LL)(n); (i) < (LL)(m); ++(i))
#define REP2R(i, n, m) for (LL i = (LL)(n)-1; (i) >= (LL)(m); --(i))


int main() {
  int N;
  cin >> N;

  map<int,int> cnt;
  REP2(i, 2, sqrt(N)+1) {
    if (N % i == 0) {
      while (N % i == 0) {
        N /= i;
        ++cnt[i];
      }
    }
  }

  if (N != 1) ++cnt[N];
  
  int xsum = 0;
  for (auto [a, b] : cnt) xsum ^= b;

  cout << (xsum ? "Alice" : "Bob") << endl;
  return 0;
}