//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 ans = 0;
        HashMap<Long,Integer> map = primeDecomposition(n);
        for (Long x : map.keySet()) {
            ans ^= map.get(x);
        }

        out.println(ans!=0?"Alice":"Bob");
    }

    static HashMap<Long,Integer> primeDecomposition(long n) {
        HashMap<Long,Integer> res = new HashMap<>();
        if (n == 1) res.put(1L,1);
        else {
            for (long i=2; i<=n; i++) {
                int cnt = 0;
                while (n%i == 0) {
                    cnt++; n /= i;
                }
                res.put(i,cnt);
            }
        }
        return res;
    }

    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));}
}