#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <string>
#include <iomanip>
#include <map>
#include <set>
#include <cmath>
#include <cstdio>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define FOR(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define All(v) (v).begin(),(v).end()
typedef long long ll;

//素因数分解
map<int64_t,int> prime_factor(int64_t n){
    map<int64_t,int>ret;
    for(int64_t i=2;i*i<=n;i++){
        while(n%i==0){
            ret[i]++;
            n/=i;
        }
    }
    if(n!=1)ret[n]=1;
    return ret;
}

int main(){
    ll N;
    cin >> N;
    auto pf = prime_factor(N);
    ll check = 0;
    for(auto p : pf){
        check = check^p.second;
    }
    if(check!=0)cout << "Alice" << endl;
    else cout << "Bob" << endl;
    return 0;
}