#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
vector<int> vec;
int main() {
	int n;
	cin >> n;
	for (int i = 2; i * i <= n; i++) {
		if (n % i == 0) {
			int co = 0;
			while (n % i == 0) {
				n /= i;
				co++;
			}
			vec.emplace_back(co);
		}
	}
	if (n != 1) {
		vec.emplace_back(1);
	}
	int x = 0;
	for (int i = 0; i < vec.size(); i++) {
		x ^= vec[i];
	}
	if (x != 0) {
		cout << "Alice" << endl;
	}
	else {
		cout << "Bob" << endl;
	}
}