#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <iterator>

#define pb push_back
#define puts(x) cout << #x << " : " << x << endl;
#pragma GCC diagnostic ignored "-Wconversion"

#define REP(i,n) for (int i=0;i<(n);i++)
#define REPE(i,n) for (int i=0;i<=(n);i++)

#define init(a,b) memset((a), (b), (sizeof(a)));

#define PI 3.14159265
#define EPS (1e-10)
#define EQ(a,b) (abs((a)-(b)) < EPS)

using namespace std;

typedef long long ll;
typedef pair<int, int> P;
vector<int> vec;

int main() {
    int n;cin>>n;
    int a = 2;
    while (n >= a * a) {
        int k=0;
        while (n % a == 0) {
            n /= a;
            k++;
        }
        if(k)vec.push_back(k);
        a++;
    }
    if(n!=1)vec.push_back(1);
    int res = 0;
    for(int v : vec) res ^= v;
    if(res)cout<<"Alice"<<endl;
    else cout<<"Bob"<<endl;

    return 0;
}