#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#define _USE_MATH_DEFINES
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#define REP(i,n) for(int (i)=0;(i)<(n);(i)++)
#define RREP(i,n) for(int (i)=(n)-1;(i)>=0;(i)--)
#define debug(x) cout<<x<<endl
using namespace std;
typedef pair<int,int> P;
typedef priority_queue<int> maxpq;
typedef priority_queue<int,vector<int>,greater<int> > minpq;
typedef priority_queue<P> p_maxpq;
typedef priority_queue<P,vector<P>,greater<P> > p_minpq;
typedef vector<int> veci;
typedef vector<P> vecp;
typedef vector<string> vecs;
#define INF 2000000000
struct edge{int to,cost;};

bool e[100000000] = {false};
int main(void) {
	int n;cin >> n;
	for(int i = 2;i <= n;i++) {
		if(e[i]) continue;
		for(int j = i+i;j <= n;j+=i) {
			e[j] = true;
		}
	}
	int ans = 0;
	for(int i = 2;i <= n;i++) {
		if(!e[i]) {
			int count = 0,N = n;
			while(N%i==0) {
				N /= i;
				count++;
			}
			ans = ans^count;
		}
	}
	if(ans) cout << "Alice" << endl;
	else cout << "Bob" << endl;
	return 0;
}