import math
n=input()
def trial_division_sqrt(n):
	prime_count = {}
	
	for i in xrange(2, int(math.sqrt(n)) + 2):
		while n % i == 0:
			n /= i
			if i in prime_count:
				prime_count[i] += 1
			else:
				prime_count[i]=1
	if n > 1:
		if n in prime_count:
			prime_count[n] += 1
		else:
			prime_count[n]=1
	
	return prime_count
#print trial_division_sqrt(n)
p=trial_division_sqrt(n)
p=[p[i]for i in p]
#print p
print["Alice","Bob"][reduce(lambda a,b:a^b,p)==0]