#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#define REP(i,n) for(int i = 0; n > i; i++)

using namespace std;
typedef vector<int> Ivec;
typedef pair<int, int> pii;
int arr[50000000];

void Eratosthenes(int N) {
	for (int i = 0; i < N; i++) {
		arr[i] = 1;
	}
	for (int i = 2; i < sqrt(N); i++) {
		if (arr[i]) {
			for (int j = 0; i * (j + 2) < N; j++) {
				arr[i *(j + 2)] = 0;
			}
		}
	}
	int cou = 0;
	for (int i = 2; N >= i; i++) {
		if (arr[i]) {
			arr[cou] = i;
			cou++;
		}
	}
}
int main() {
	int n;
	int ans = 0,count = 0;
	scanf("%d", &n);
	Eratosthenes(n / 2 + 1);
	int cur = 0;
	while(n != 1) {
		if (arr[cur] <= 1) {
			count = 1;
			break;
		}
		else if (!(n%arr[cur])) {
			count++;
			n /= arr[cur];
		}
		else {
			ans = ans^count;
			count = 0;
			cur++;
		}
	}
	ans = ans^count;
	printf("%s\n", ans ? "Alice" : "Bob ");
	return 0;
}