import java.util.*;
import java.io.*;
import java.awt.geom.*;
import java.math.*;

public class No0002 {
    
    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[][] f = requirePrimeFactor(n);
        int x = 0;
        for (int[] y : f) {
            x ^= y[1];
        }
        out.println(x != 0 ? "Alice" : "Bob");
    }

    static int[][] requirePrimeFactor(int n) {
        if (n < 2) return null;
        int[][] ret = new int[n+1][];
        boolean[] isPrime = new boolean[n+1];
        Arrays.fill(isPrime,true);

        int ptr = 0;
        for (int i=2; i*i<=n; i++) {
            if (!isPrime[i]) continue;
            for (int j=i*2; j<=n; j+=i) isPrime[j] = false;

            int exp = 0;
            while (n%i == 0) {
                n /= i;
                exp++;
            }
            if (exp > 0) ret[ptr++] = new int[]{i,exp};
        }

        if (n > 1) ret[ptr++] = new int[]{n,1};

        return Arrays.copyOfRange(ret,0,ptr);
    }

    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(Arrays.deepToString(o));}
}