#include <iostream>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <cstdio>
#include <sstream>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <set>
#include <map>
#include <list>
#include <iomanip>

#define INF 1000000001
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
const double PI = acos(-1.0);

struct Edge {
	int to;
	int cost;
	int time;
	Edge(int a,int b,int c):to(a),cost(b),time(c){}
};

int N;

int factor(int d, int n)
{
	for (int i = d; i*i<=n; i++) {
		if (n%i==0) return i;
	}
	return n;
}

int main()
{
	ios::sync_with_stdio(false);

	cin >> N;

	vector<int> v;

	int d=2;
	while (N > 1) {
		d = factor(d, N);
		v.push_back(0);
		while (N%d==0) {
			v[v.size()-1]++;
			N/=d;
		}
	}
	int x=0;
	FOR(i,0,v.size()) {
		x ^= v[i];
	}
	string ans= (x) ? "Alice" : "Bob";
	cout << ans << endl;
	
	return 0;
}