#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=n;i<N;i++)
#define p(S) cout<<(S)<<endl
#define ck(a,b) (0<=(a)&&(a)<b)
typedef long long ll;
using namespace std;
typedef long long ll;
map<ll, int> enumpr(ll n) {//
	map<ll, int> V;
	for (ll i = 2; i*i <= n; i++) while (n%i == 0) V[i]++, n /= i;
	if (n>1) V[n]++;
	return V;
}


int main(){
	ll n;
	cin>>n;
	auto m = enumpr(n);
	int g=0;
	for(auto p:m){//Nim
		g=g^p.second;
	}
	if(g!=0) cout<<"Alice"<<endl;
	else cout<<"Bob"<<endl;
	return 0;
}