#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())
#define indexOf(v,x) (find(all(v),x)-v.begin())



//素因数分解 O(√n)
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(1<n)res[n]=1;
	return res;
}

int main(){
	int n,b=0;
	cin>>n;
	map<int,int> f(prime_factor(n));
	map<int,int>::iterator it;
	for(it=f.begin();it!=f.end();++it){
		b^=it->second;
	}
	cout<<(b?"Alice":"Bob")<<endl;
	return 0;
}