#include <bits/stdc++.h>
using namespace std;


vector<int> natural_factorization(int n){
    int temp=2;
    vector<int> ret={};
    while(n>=pow(temp,2)){
        if(n%temp==0){
            ret.push_back(temp);
            n=n/temp;
        }else{
            temp++;
        }
    }
    ret.push_back(n);
    return ret;
}

template<typename type>
tuple<vector<type>,vector<int>> vector_runlength(vector<type> v){
    vector<type> element={};
    vector<int> number={};
    int consecutive=1;
    int n=v.size();
    for(int i=1;i<n;i++){
        if(v[i]==v[i-1]){
            consecutive++;
        }else{
            element.push_back(v[i-1]);
            number.push_back(consecutive);
            consecutive=1;
        }
    }
    element.push_back(v[n-1]);
    number.push_back(consecutive);
    return forward_as_tuple(element,number);
}

int main(){
    int n;
    cin>>n;
    vector<int> a=natural_factorization(n);
    vector<int> c;
    tie(ignore,c)=vector_runlength(a);
    int p=0;
    for(int i=0;i<c.size();i++){
        p=p^c[i];
    }
    cout<<(p==0?"Bob":"Alice");
}