#if 1
#ifdef INCLUDED_MAIN
cint maxN{ (int)1e8 };
vector<int> num;
vector<int> prime;
vector<bool> is_prime;
int sieve(int n) {
    prime.reserve(n / 2);
    is_prime.resize(n, true);
    is_prime[0] = is_prime[1] = false;
    for (int i{ 2 }; i < n; ++i) {
        if (!is_prime[i])continue;
        prime.push_back(i);
        for (int j{ i * 2 }; j < n; j *= i)is_prime[j] = false;
    }
    return prime.size();
}
int main() {
    REDIRCT_IO;
    int N;
    cin >> N;
    int p{ sieve((int)sqrt(N) + 1) };
    num.resize(p + 1);
    rep(i, p) {
        while (N % prime[i] == 0) { N /= prime[i]; ++num[i]; }
    }
    if (N != 1)num[p] = 1;
    int x{ 0 };
    rep(i, p)x ^= num[i];
    cout << (x ? "Alice" : "Bob") << endl;
    RESTORE_IO;
    return 0;
}

#else

#include<bits/stdc++.h>
#ifdef _INTEGRAL_MAX_BITS
#include"C:\Users\Spare\source\repos\Competitive_programming\Competitive_programming\debugging.h"
#endif
#ifndef DEBUGGING
#define MY_MAIN int main()
#define REDIRCT_IO ;
#define RESTORE_IO ;
#endif
#define sc static
#define ct const
#define ft first
#define sd second
using namespace std;
using ld = long double;
using ll = long long;
using cchar = const char;
using cint = const int;
using cll = const ll;
using uchar = unsigned char;
using uint = unsigned int;
using ull = unsigned long long;
using cuchar = const uchar;
using cuint = const uint;
using cull = const ull;
template<class TYPE> static const TYPE INF = numeric_limits<TYPE>::max();
#define rep(i, n) for(int i = (0), fend = n; i < fend; ++i)
static const string ascii_lowercase = "abcdefghijklmnopqrstuvwxyz";
static const string ascii_uppercase = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
#define INCLUDED_MAIN
#include __FILE__
#endif

#endif