#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>

using namespace std;

vector< pair<int,int> > divisors(int N){
	vector< pair<int,int> > ret;
	for(int i=2; i*i<=N; i++){
		int tmp = 0;
		while(N%i==0){
			tmp++;
			N/=i;
		}
		if(tmp>0){
			ret.push_back( make_pair(i, tmp) );
		}
	}
	if(N!=1){
		ret.push_back( make_pair(N, 1) );
	}
	return ret;
}

int main(){
	int n;
	cin >> n;
	vector< pair<int,int> > d = divisors(n);
	int ans = 0;
	for(int i=0; i<d.size(); i++){
		ans ^= d[i].second;
	}
	cout << (ans==0?"BoB":"Alice") << endl;
	return 0;
}