//No.2 素因数ゲーム

import java.util.*;
import java.io.*;
import static java.util.Arrays.*;
import static java.lang.Math.*;

public class No2 {
    
    static final Scanner in = new Scanner(System.in);
    static final PrintWriter out = new PrintWriter(System.out,false);

    static void solve() {
        int n = in.nextInt();
        int x = n, ans = 0;
        boolean[] isPrime = new boolean[n+1];
        fill(isPrime,true);
        isPrime[0] = isPrime[1] = false;
        for (int i=2; i<=n; i++) {
            if (isPrime[i]) {
                int cnt = 0;
                while (x%i == 0 && x > 1) {
                    x /= i;
                    cnt++;
                }
                ans ^= cnt;
                if (x == 1) break;
                for (int j=i+i; j<=n; j+=i) {
                    isPrime[j] = false;
                }
            }
        }
        out.println(ans!=0?"Alice":"Bob");
    }

    public static void main(String[] args) {
        long start = System.currentTimeMillis();

        solve();
        out.flush();

        long end = System.currentTimeMillis();
        //trace(end-start + "ms");
        in.close();
        out.close();
    }

    static void trace(Object... o) { System.out.println(deepToString(o));}
}