import java.util.HashMap; import java.util.Map; import java.util.Scanner; public class Main_yukicoder2 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); Map pf = primeFactorization(n); int ret = 0; for (int e : pf.values()) { ret ^= e; } if (ret == 0) { System.out.println("Bob"); } else { System.out.println("Alice"); } sc.close(); } private static Map primeFactorization(int n) { Map hm = new HashMap(); int tmp = n; for (int j = 2; j * j <= n; j++) { while (tmp % j == 0) { if (hm.containsKey(j)) { hm.put(j, hm.get(j) + 1); } else { hm.put(j, 1); } tmp /= j; } } if (tmp != 1) { if (hm.containsKey(tmp)) { hm.put(tmp, hm.get(tmp) + 1); } else { hm.put(tmp, 1); } } return hm; } }