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

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> veci;
typedef vector<string> vecs;
template<class T,class U> using Hash=unordered_map<T,U>;

#define REP(i, a, n) for(ll i = a; i < n; i++)
#define RREP(i, a, n) for(ll i = n-1; i >= a; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define MD 1000000007

template<class T> T read(){T a;cin >> a;return a;}
template<class T> void read(T& a){cin >> a;}
template<class T> void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}}
template<class T> void write(T a){cout << a << endl;}
template<class T> void writes(vector<T> a, const char* c = " "){cout << a[0];for(int i = 1; i < (int)a.size(); i++)cout << c << a[i];cout << endl;;}
void write(double a){cout << fixed << setprecision(12) << a << endl;}
void write(long double a){cout << fixed << setprecision(12) << a << endl;}
template<class T> void warr(T a, int n, const char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;}
void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}}
void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}}
ll gcd(ll a, ll b){while(true){ll k = a % b;if(k == 0)return b;a = b;b = k;}}
ll comb(ll n, ll m){ll p=1;m=min(m,n-m);for(ll i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;}

int a[40]={0};
int ai=0;

bool inc(int* pa,int n){
    int i=0;
    while(i<n){
        if(pa[i]==a[i]){
            pa[i++]=0;
        }
        else{
            pa[i]++;
            break;
        }
    }
    return i<n;
}

int main(void)
{
    int n;
    cin>>n;
    int sn=sqrt(n);
    int tn=n;
    REP(i,2,sn+1){
        if(tn<=1)break;
        if(tn%i!=0)continue;
        while(tn%i==0){
            a[ai]++;
            tn/=i;
        }
        ai++;
    }
    if(tn>1)a[ai++]++;
    sort(a,a+ai);
    int b[40]={0};
    int x=1;
    bool dp[1000*100]={0};
    while(inc(b,ai)){
        int c[40]={0};
        int i=-1;
        do{
            int count=0;
            i++;
            rep(j,ai){
                if(b[j]==c[j])
                    count++;
            }
            if(count==ai)break;
            if(count!=ai-1){
                continue;
            }
            dp[x]|=!dp[i];
        }while(inc(c,ai));
        //cout<<b[0]<<" "<<b[1]<<endl;
        x++;
    }
    //rep(i,x)cout<<dp[i]<<" ";
    //cout<<endl;
    if(dp[x-1])write("Alice");
    else write("Bob");
    return 0;
}