#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <map>

using namespace std;

void set_prime(int);

map<int, int> primes;

int main() {
	int n;

	cin >> n;

	while (n % 2 == 0) {
		n /= 2;
		set_prime(2);
	}

	for (int i = 3; i * i <= n; i += 2) {
		while (n % i == 0) {
			n /= i;
			set_prime(i);
		}
	}

	if (n != 1) {
		set_prime(n);
	}

	int nim;
	map<int, int>::iterator it;
	for (it = primes.begin(); it != primes.end(); it++) {
		if (it == primes.begin()) {
			nim = it->second;
		} else {
			nim ^= it->second;
		}
		// printf("%5d %3d %3d\n", it->first, it->second, nim);
 	}

 	cout << (nim != 0 ? "Alice" : "Bob") << endl;
	return 0;
}

void set_prime(int p) {
	if (primes.count(p)) {
		primes[p]++;
	} else {
		primes[p] = 1;
	}
}