#include <iostream> 
#include<vector>
#include<algorithm>
#include<map>
#include<string>
#include<iomanip>
#include<set>
#include<queue>
#include<deque>
#include<sstream>
#include<cmath>
#include<bitset>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define req(i,n) for(int i = 1;i <=  n; i++)
#define rrep(i,n) for(int i = n-1;i >= 0;i--)
#define ALL(obj) begin(obj), end(obj)
#define RALL(a) rbegin(a),rend(a)
typedef long long int ll;
typedef long double ld;
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T& val) {
    std::fill((T*)array, (T*)(array + N), val);
}
const int inf = 1<<31-1;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(void) {
    ll n; cin >> n;
    vector<ll> p;
    ll m = n, sum = 0;
    while (n % 2 == 0) {
        n /= 2; sum++;
    }if (sum > 0)p.push_back(sum);
    sum = 0;
    for (int i = 3; i * i <= m; i += 2) {
        while (n % i == 0) {
            n /= i; sum++;
        }if (sum > 0)p.push_back(sum);
        sum = 0;
    }int ans = 0;
    if (n * n > m) p.push_back(1);
    for (int i : p) ans ^= i;
    if (ans != 0) cout << "Alice" << endl;
    else cout << "Bob" << endl;
}