#include<algorithm>
#include<cmath>
#include<complex>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<vector>
using namespace std;

typedef long long int ll;
typedef unsigned long long int llu;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;

#define rrep(i, m, n) for(int i=m; i<n;  i++)
#define erep(i, n)    for(int i=1; i<=n; i++)
#define  rep(i, n)    for(int i=0; i<n;  i++)
#define rrev(i, m, n) for(int i=n-1; i>=m; i--)
#define erev(i, n)    for(int i=n; i>=1; i--)
#define  rev(i, n)    for(int i=n-1; i>=0; i--)
#define EACH(v)       (v).begin(), (v).end()
#define CNT(a, n, x)  (upper_bound(a, a+n, x)-lower_bound(a, a+n, x))
#define minup(m, x)   (m=min(m, x))
#define maxup(m, x)   (m=max(m, x))
#define mp             make_pair

#define INF 1000000000
#define MOD 1000000009
#define EPS 1E-9

#define MAX_N 100000000

ll n;
ll prime[MAX_N];
bool isPrime[MAX_N];
int ptr;

int main()
{
  cin >> n;

  for(int i=2; n%i==0; i*=2){
    prime[ptr] += 1;
  }

  if(prime[ptr]) ptr += 1;
  for(int i=3; i<=sqrt(n); i+=2){
    if(!isPrime[i]){
      for(int j=2*i; j<=sqrt(n); j+=i){
        isPrime[j] = true;
      }
      int j;
      for(j=i; n%j==0; j*=i){
        prime[ptr] += 1;
      }
      if(prime[ptr]) ptr += 1;
    }
  }

  int res = 0;

  rep(i, ptr) {
    res ^= prime[i];
  }

  puts(!ptr ? "Alice" :  res ? "Alice" : "Bob");

  return 0;
}