#include <bits/stdc++.h>
#define REP(i,n) for (long i=0;i<(n);i++)
#define FOR(i,a,b) for (long i=(a);i<(b);i++)
#define RREP(i,n) for(long i=n;i>=0;i--)
#define RFOR(i,a,b) for(long i=(a);i>(b);i--)
#define dump1d_arr(array) REP(i,array.size()) cerr << #array << "[" << (i) << "] ==> " << (array[i]) << endl;
#define dump2d_arr(array) REP(i,array.size()) REP(j,array[i].size()) cerr << #array << "[" << (i) << "]" << "[" << (j) << "] ==> " << (array[i][j]) << endl;
#define dump(x)  cerr << #x << " => " << (x) << endl;
#define CLR(vec) { REP(i,vec.size()) vec[i] = 0; } 
#define llINF (long long) 9223372036854775807
#define loINF (long) 2147483647
#define shINF (short) 32767
#define SORT(c) sort((c).begin(),(c).end())
#define MIN(vec) *min_element(vec.begin(), vec.end());
#define MAX(vec) *max_element(vec.begin(), vec.end());

using namespace std;
typedef vector<long> VI;
typedef vector<VI> VVI;
typedef map<long,long> mp;

int main(void){
	long long N,n;
	cin >> N;
	n = N;
	long iter_max = sqrt(N);
	VI prime(iter_max+1,0);

	FOR(i,2,iter_max+1){
		if (N == 1) break;
		if (!(N % i)){
			prime[i]++;
			N /= i;
		}
	}
	
	long nim;

	if (N != 1)  nim = 1;
	else nim = 0;

	FOR(i,2,iter_max+1){
		if (prime[i] != 0) nim ^= prime[i];
	}

	if (nim == 0) cout << "Bob" << endl;
	else cout << "Alice" << endl;

	return 0;
}