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


int main(void){
	ll n;
	cin>>n;
	ll pnum=0;
	ll m=n;
	for(ll i=2;i<=sqrt(m)+1;i++){
		if(n%i!=0)continue;
		while(true){
			if(n%i==0)n/=i;
			else {
				pnum++;
				break;
			}
		}
	}
	if(n>1)pnum++;
	//cout<<pnum<<endl;
	if(pnum%2==0)cout<<"Alice"<<endl;
	else cout<<"Bob"<<endl;
    return 0;
}