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<int[]> 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<int[]> requirePrimeFactor(int n) {
		if (n < 2) return null;
		ArrayList<int[]> ret = new ArrayList<int[]>();
		ArrayList<Integer> 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<Integer> createPrimeList(int offset, int n) {
		if (n < 2) return null;
		ArrayList<Integer> ret = new ArrayList<Integer>();
		BitSet isPrimeBit = createIsPrimeBit(offset,n);
		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<n; i++) {
			if (!ret.get(i)) continue;
			for (int j=i+i; j<n; j+=i) ret.flip(j);
		}
		return ret;
	}

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