#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <numeric>
#include <set>

using namespace std;

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define REPO(i, n) for(int i = 1;i <= n;i++)
#define INF 999999999
#define MINF -999999999
#define ALL(n) n.begin(),n.end()
#define ll long long
#define MOD 1000000007

ll ans = 0, n;
int main() {
	cin >> n;
	ll a = n;
	for (int i = 2; i <= sqrt(n); i++) {
		if (a == 1)break;
		int c = 0;
		REP(j, INF) {
			if (a % i != 0)break;
			a /= i;
			c++;
		}
		ans = ans xor c;
	}
	if (a != 1)ans = ans xor 1;
	cout << (ans == 0 ? "Bob" : "Alice") << endl;
}