#include <iostream>
#include <unordered_map>
using namespace std;

int main() {
	int n;
	cin >> n;

	unordered_map<int, int> count_prime_factors;
	while (n != 1) {
		for (int i = 2; i <= n; i++) {
			if (n % i == 0) {
				n /= i;
				count_prime_factors[i]++;
				break;
			}
		}
	}

	int bit = 0;
	for (auto pair : count_prime_factors) {
		bit ^= pair.second;
	}

	if (bit == 0) {
		cout << "Bob" << endl;
	}
	else {
		cout << "Alice" << endl;
	}

	return 0;
}