#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
//using mint = static_modint<998244353>;
using mint = static_modint<1000000007>;
//using misht = static_modint<2147483647>;
using vm = vector<mint>;
using vvm = vector<vm>;
using pl = pair<ll,ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);++i)
#define reps(i,s,n) for(ll i=(s);i<(ll)(n);++i)
#define rep1(i,n) for(ll i=1;i<=(ll)(n);++i)
#define ts(i) to_string(i)
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
ostream &operator<<(ostream &o,const mint &m){cout<<m.val();return o;}
const long long INF = 1e18;

#ifdef DEBUG
#include <debug.hpp>
#endif

int main(){
#ifdef DEBUG
	cout << "--- Input ---" << endl;
#endif
	ll N;
	cin >> N;

	auto f = [&](ll n){
		map<ll,ll> ret;
		for(ll i=2;i*i<=n;++i){
			ll tmp=0;
			while(n%i==0){
				++tmp;
				n /= i;
			}
			if(tmp>0)ret[i]=tmp;
		}
		if(n!=1)ret[n]=1;
		return ret;
	};
#ifdef DEBUG
	for(auto i : f(N)){
		cout << i.first << " " << i.second << endl;
	}
	cout << "--- Logic ---" << endl;
#endif
	ll xor_sum=0;
	for(auto i : f(N)){
		xor_sum^=i.second;
	}
#ifdef DEBUG
	cout << "--- Answer ---" << endl;
#endif
	if(xor_sum==0)cout << "Bob" << endl;
	else cout << "Alice" << endl;
}
//cout << fixed << setprecision(9);