#include <iostream>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <map>
#include <cmath>
#include <queue>
#include <utility>
#include <functional>
#include <deque>
#include <cctype>
#include <stack>
#include <bitset>

using ll = long long;
using namespace std;
typedef unsigned long long ull;
typedef pair<ll, ll>P;

ll gcd(ll a, ll b) {
	if (b == 0) return a;
	return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
	ll g = gcd(a, b);
	return a / g * b;
}

const ll mod = 1000000007;
const ll INF = 1 << 30;
const ll INF2 = 9000000000000000000LL;
bool fl = true;
int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
string abc = "abcdefghijklmnopqrstuvwxyz";
struct edge { ll to, cost; };
struct edge1 { ll from, to, cost; };
double pai = 3.141592653589793;

int main() {
	ll n, a[100010] = {0
	};
	cin >> n;
	int i = 2;
	while (true) {
		if (i == 100001 || n == 1)break;
		if (n%i != 0) {
			i++;
			continue;
		}
		a[i]++;
		n /= i;
	}
	if (n == 1) {
		int x = 0;
		for (int i = 2;i < 100001;i++) {
			if (a[i] == 0)continue;
			x ^= a[i];
		}
		if (x != 0) cout << "Alice" << endl;
		else cout << "Bob" << endl;
	}
	else {
		int x = 1;
		for (int i = 2;i < 100001;i++) {
			if (a[i] == 0)continue;
			x ^= a[i];
		}
		if (x != 0) cout << "Alice" << endl;
		else cout << "Bob" << endl;
	}
}