#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <limits>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <complex>

using namespace std;

#define INF (INT_MAX/3)
#define PI (2*acos(0.0))
#define EPS (1e-8)

typedef long long ll;
typedef unsigned long long ull;

bool isPrime[100000001];
ll N;
vector<int> prime;
map<int, int> mp;

void init(){
    for(int i = 0; i <= 100000000; i++) isPrime[i] = true;

    isPrime[0] = isPrime[1] = false;
    for(int i = 2; i * i <= 100000000; i++){
        if(!isPrime[i]) continue;
        prime.push_back(i);
        for(int j = i * i; j <= 100000000; j += i){
            isPrime[i] = false;
        }
    }
}

int main(){
    ios_base::sync_with_stdio(0);
    init();
    cin >> N;
    for(auto p : prime){
        while(N % p == 0){
            N /= p;
            mp[p]++;
        }
    }
    int ans = 0;
    for(auto m : mp){
        ans ^= m.second;
    }
    if(ans == 0) cout << "Bob" << endl;
    else cout << "Alice" << endl;
    return 0;
}