#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<math.h>
using namespace std;
#define mod (1000000000+7)
#define N (10007)
#define INF 1e16
typedef long long ll;
typedef pair<ll,ll> P;

int g[100010];

int main(void){
    ll n;
    cin>>n;
    ll M = n;
    ll ans = 0;
    for(ll i=2;i*i<=M;i++){
        ll num=0;
        while(n%i==0){
            num++;
            n/=i;
        }
        if(num!=0){
            ans^=num;
        }
    }
    if(n>1)ans^=1;
    if(ans==0)cout<<"Bob"<<endl;
    else cout<<"Alice"<<endl;
    return 0;
}