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(); ArrayList f = requirePrimeFactor(n); //trace(f.toArray()); int x = 0; for (int[] y : f) { x ^= y[1]; } out.println(x != 0 ? "Alice" : "Bob"); } public static ArrayList requirePrimeFactor(int n) { if (n < 2) return null; ArrayList ret = new ArrayList(); ArrayList primes = createPrimeList(0,n+1); for (int p : primes) { int exp = 0; while (n%p == 0) { n /= p; exp++; } if (exp > 0) ret.add(new int[]{p,exp}); } if (n > 1) ret.add(new int[]{n,1}); return ret; } public static ArrayList createPrimeList(int offset, int n) { if (n < 2) return null; ArrayList ret = new ArrayList(); BitSet isPrimeBit = createIsPrimeBit(offset,(int)(Math.sqrt(n)+0.5)); int p = 1; while ((p = isPrimeBit.nextSetBit(p+1)) >= 0) { ret.add(p); } return ret; } public static BitSet createIsPrimeBit(int offset, int n) { if (n < 2) return null; BitSet ret = new BitSet(); ret.flip(2,n); for (int i=2; i*i