#include "bits/stdc++.h"

#define REP(i,n) for(ll i=0;i<ll(n);++i)
#define RREP(i,n) for(ll i=ll(n)-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<ll(n);++i)
#define RFOR(i,m,n) for(ll i=ll(n)-1;i>=ll(m);--i)
#define ALL(v) (v).begin(),(v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP(aa, (v).size()) { cout << v[aa]; if (aa != v.size() - 1)cout << " "; else cout << endl; }
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9

const int dx[8] = { 1,1,0,-1,-1,-1,0,1 };
const int dy[8] = { 0,1,1,1,0,-1,-1,-1 };


using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll max(ll a, int b) { return max(a, ll(b)); }
ll max(int a, ll b) { return max(ll(a), b); }
ll min(ll a, int b) { return min(a, ll(b)); }
ll min(int a, ll b) { return min(ll(a), b); }
///(´・ω・`)(´・ω・`)(´・ω・`)(´・ω・`)(´・ω・`)(´・ω・`)///


int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n;
	cin >> n;
	vi isprime(10000,1);
	isprime[0] = 0; isprime[1] = 0;
	REP(i, 10000) {
		if (isprime[i]) {
			for (int j = 2; i*j < 10000; ++j) {
				isprime[i*j] = 0;
			}
		}
	}
	vi p;
	REP(i, 10000) {
		if (isprime[i])p.push_back(i);
	}
	int k = p.size();
	vi cnt(k, 0);
	REP(i, k) {
		while (n%p[i] == 0) {
			cnt[i]++;
			n /= p[i];
		}
	}
	int x = 0;
	REP(i, k)x ^= cnt[i];
	if (n != 1)x ^= 1;
	if (x == 0)cout << "Bob" << endl;
	else cout << "Alice" << endl;


}