#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

#define REP(i,s,e) for (i = s; i <= e; i++)
#define rep(i,n) REP (i,0,(int)(n)-1)
#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP (i,(int)(n)-1,0)
#define INF (int)1e8
#define MOD (int)(1e9+7)

typedef long long ll;

int main(void) {
    int n;
    map<int,int> mp;
    cin >> n;

    for (int i = 2; i * i <= n; i++) {
        if (n % i == 0) {
            mp[i]++;
            n /= i;
            i--;
        }
    }
    mp[n]++;
    int ans = 0;
    for (auto p : mp)
        ans ^= p.second;
    if (ans == 0)
        cout << "Bob" << endl;
    else
        cout << "Alice" << endl;
    return 0;
}