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 x = 0; int[] primes = sieveOfEratosthenes(n+1); int ptr = 0; while (n != 1) { int cnt = 0; while (n%primes[ptr] == 0) { n /= primes[ptr]; cnt++; } x ^= cnt; ptr++; } out.println(x != 0 ? "Alice" : "Bob"); } static int[] sieveOfEratosthenes(int n) { if (n < 2) return null; boolean[] isPrime = new boolean[n]; Arrays.fill(isPrime,true); int[] res = new int[n]; int ptr = 0; isPrime[0] = isPrime[1] = false; for (int i=2; i