#include "bits/stdc++.h"
using namespace std;

typedef long long Int;
#define REP(i,n) for(int (i)=0;(i)<(int)(n);++(i))

const int MAX_N = 1000000;
bool isp[MAX_N];
vector<int> ps;

map<int, int> memo;

int dp(const int n) {
	if (memo.find(n) != memo.end()) return memo[n];
	if (n == 1) return 0;
	int res = 0;
	vector<int> divs;
	int m = n;
	for (int i = 0; (Int)ps[i] * ps[i] <= m; i++) {
		if (m % ps[i] == 0) {
			divs.push_back(ps[i]);
			do { m /= ps[i]; } while (m % ps[i] == 0);
		}
	}
	if (m > 1) divs.push_back(m);
	REP(i, divs.size()) {
		int d = divs[i];
		int t = n;
		while (t % d == 0) {
			t /= d;
			if (!dp(t)) {
				res = 1;
			}
		}
	}
	return memo[n] = res;
}

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

	for (int i = 0; i < MAX_N; i++) isp[i] = true;
	isp[0] = isp[1] = false;
	for (int i = 2; i < MAX_N; i++) {
		if (isp[i]) {
			ps.push_back(i);
			for (int j = i + i; j < MAX_N; j += i) isp[j] = false;
		}
	}

	if (dp(N)) cout << "Alice" << endl;
	else cout << "Bob" << endl;

}