#include <bits/stdc++.h>
#include <climits>
#define LOOP(n) for (int _i = 0; _i < (n); _i++)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, r, n) for (int i = (r); i < (n); ++i)
#define ALL(obj) begin(obj), end(obj)

using namespace std;
typedef long long ll;
typedef pair<ll, ll> PR;

const int INF = (int) 1e8;
const double pi = acos(-1);


int N, n;
int factors[(int)1e8 + 1];
int G[30];



int main() {
	cin >> N;

	int cur = N;
	int j = 0; n = -1;
	for (int i = 2; i < sqrt(N);) {
		if (cur % i == 0) {
			if (j == 0) n++;

			cur /= i;
			factors[n] = ++j;
		}
		else {
			i++;
			j = 0;
		}
	}
	if (cur > 1) factors[++n] = 1;

	int ans = 0;
	REP(i, n+1) {
		ans ^= factors[i];
	}
	if (ans != 0) cout << "Alice" << endl;
	else cout << "Bob" << endl;
}