#include <bits/stdc++.h>
#include <set>
#include <cstdio>
#include <vector>
#include <iostream>
#include <utility>
#include <queue>
#include <algorithm>
#include <math.h>

#define fir first
#define sec second
#define get(n) scanf("%d",&n);
#define gets(s) string s;cin >> (s);
#define All(s) (c).begin(), (c).end()
#define chmin(x, y) x = min(x, y);
#define chmax(x, y) x = max(x, y);
#define rep(i, j) for (int (i)=0;(i)<(j);(i)++)
#define repk(i, j, k) for(int (i)=(j);(i)<(k);(i)++)
#define dump(x)  cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
using namespace std;
typedef long long int ll;
const ll INF = 10241024;

vector<int> num(1000,0);
vector<int> PrimeNum(1000,0);
int loc = 1;//Primenum の最後尾のインデックスを示す。

void MakePriNum(int n) {//nまでの素数のvector
    PrimeNum.push_back(2);
    PrimeNum.push_back(3);
    int m = sqrt(n);
    for (int i=4;i<=m;i++) {
        int j=0;
        while(PrimeNum[j] != 0) {
            int k = PrimeNum[j];
            if(i % k == 0)
            {
                break;
            }
            if(j == loc)
            {
                PrimeNum.push_back(i);
            }
            j++;
        }
    }
}


int N;
void input(){
    cin >> N;
    MakePriNum(N);
}

void solve(){
    input();
    int n=N;
    int locOnum = 0;
    for(int i=0;i<=loc;i++){
        int k = PrimeNum[i];
        while(true){
            int mod = n % k;
            n /= k;
            if(mod == 0)
            {
                num[locOnum]++;
            }
            else 
            {
                locOnum++;
                break;
            }
            if(n == 1){
                cout << "Alice" << endl;
                return ;
            }
        }
    }

    sort(num.rbegin(), num.rend());
    int xsum = 0;
    int mou = 0;
    for(int i=0;i<=loc;i++){
        if(num[i] != 0)
        {
            xsum = xsum +(num[i] % 2);
            mou++;
        }
    }
    if(mou == 1)
    {
        cout << "Alice" << endl;
        return;
    }
    if(xsum % 2 == 0)
    {
        cout << "Bod" << endl;
        return;
    }

    cout << "Alice" << endl;
}   
int main () {
    solve();
    return 0;
}