#include <iostream>
#include <vector>
#include <array>
#include <algorithm>
#include <string>
#include <map>
#include <queue>
#include <iomanip>
#include <numeric>
#include <memory>
#include <limits.h>
#include <set>
#include <cassert>
#include <cmath>
#include <bitset>
#include <functional>
#include <limits>
using namespace std;

typedef long long ll;

#define REP(i,n) for(ll i=0; i<(n); ++i)
#define TEN(x) ((ll)1e##x)
#define ALL(v) (v).begin(), (v).end()

// 素因数分解 O(√n)
// pair<vector<素因数>, vector<指数>>
pair<vector<ll>, vector<ll>> primeFactors(ll n){
    vector<ll> p,e;
    ll m = n;
    for(ll i = 2; i*i <= n; i++){
        if(m%i != 0) continue;
        int c = 0;
        while(m%i == 0) c++, m /= i;
        p.push_back(i); e.push_back(c);
    }
    if(m > 1){
        p.push_back(m); e.push_back(1);
    }
    return make_pair(p,e);
}

int main(){
	ll n;
	cin >> n;
	auto f = primeFactors(n).second;
	int x = 0;
	REP(i, f.size()) x ^= f[i];
	cout << (x != 0 ? "Alice" : "Bob") << endl;
	return 0;
}