#include <iostream>
#include <numeric>
#include <algorithm>
#include <string>
#include <vector>
#include <functional>
#include <cmath>
#include <queue>

#define rep(i, a) FOR(i, 0, a)
#define FOR(i, a, b) for(int i = a; i < b; ++i)

typedef long long ll;
typedef unsigned long long ull;
typedef std::pair<int, int> P;
struct edge{ int to, time, cost; };

const int max = (int)1e+8 + 10;

int main(){
	int n;
	std::cin >> n;
	int cnt = 0;
	int i = 2;
	int ans = 0;
	while (n != 1){
		while (n % i == 0)n /= i, ++cnt;
		ans ^= cnt;
		cnt = 0;
		++i;
	}
	std::cout << (ans == 0 ? "Bob" : "Alice") << std::endl;
	return 0;
}