#include <bits/stdc++.h>
#include <iostream>
#include<queue>
#include<deque>
using namespace std;
#define REP(a,b) for(ll a=0; a< b; ++a)
#define FOR(i, a, b) for(ll i=a; i< b; i++) 
#define INFTY 2000000000
#define ll long long
#define MOD 1000000007;


#define BIT(a, b)  a&(1 << b)



template <typename T>
map<T, T> prime_factor(T n) {
    map<T, T> ret;
    for (T i = 2; i * i <= n; i++) {
        T tmp = 0;
        while (n % i == 0) {
            tmp++;
            n /= i;
        }
        ret[i] = tmp;
    }
    if (n != 1) ret[n] = 1;
    return ret;
}



int main() {
    ll N;
    cin  >> N;
    map<ll, ll> factor = prime_factor(N);
    ll nim  = 0;
    for(auto a : factor) {
        nim ^= a.second;
    }
    if(nim == 0) { cout << "Bob" << endl; }
    else { cout << "Alice" << endl; }
}