#include <bits/stdc++.h>

using namespace std;

typedef pair<int,int> P;
typedef pair<int,pair<int,int>> PP;
typedef long long ll;

const double EPS = 1e-8;
const int INF = 1e9;
const int MOD = 1e9+7;

int dy[] = {0,1,0,-1};
int dx[] = {1,0,-1,0};
//素因数分解
map<int,int>prime_factor(int n){
	map<int,int>res;
	for(int i=2;i*i<=n;i++){
		while(n%i==0){
			++res[i];
			n /= i;
		}
	}
	if(n!=1)res[n]=1;
	return res;
}

int main(void) {
	int n;
	cin >> n;
	map<int,int> m = prime_factor(n);
	int ans = 0;
	for(auto it=m.begin();it!=m.end();it++){
		ans ^= it->second;
	}
	if(ans == 0)cout << "Bob" << endl;
	else cout << "Alice" << endl;

	return 0;
}