#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<numeric>
#include<functional>
#include<complex>

using namespace std;
#define BET(a,b,c) ((a)<=(b)&&(b)<(c))
#define FOR(i,n) for(int i=0,i##_end=(int(n));i<i##_end;i++)
#define SZ(x) (int)(x.size())
#define ALL(x) (x).begin(),(x).end()
#define MP make_pair
#define FOR_EACH(it,v) for(__typeof(v.begin()) it=v.begin(),it_end=v.end() ; it != it_end ; it++)
typedef vector<int> VI;
typedef vector<VI> VVI;

map<int,bool> memo;

int dfs(int N){
    if(N == 1) return 0;
    if(memo.count(N)) return memo[N];
    int x = N;
    for(int i=2;i<=x;i++){
        if(x % i == 0){
            int p = 1;
            while(x % i == 0) {
                x /= i;
                p *= i;
                if(!dfs(N / p)) return memo[N] = 1;
            }
        }
    }
    if(x != 1) if(!dfs(N / x)) return memo[N] = 1;
    return memo[N] = 0;
}

int main()
{
    int n;
    cin>>n;
    puts(dfs(n)?"Alice":"Bob");
    return 0;
}