# O(n^0.5)
def isPrime(n: int) -> bool:
    if n == 1:
        return False
    if n == 2:
        return True
    for i in range(2, int(n ** 0.5) + 1):
        if n % i == 0:
            return False
    return True

# O(n log(log n))
def EraSieve(n: int) -> list:
    r = [True] * (n + 1)
    r[0] = r[1] = False
    for i in range(2, int(n ** 0.5) + 1):
        if r[i]:
            for j in range(2 * i, n + 1, i):
                r[j] = False
    return r

# 区間篩
# 注意
# e = EraSieve_Sec(a, b)
# pの素数判定:e[p - a]
def EraSieve_Sec(a: int, b: int) -> list:
    c = int(b ** 0.5) + 1
    p = [True] * c
    q = [True] * (b - a + 1)
    for i in range(2, c):
        if not p[i]:
            continue
        for j in range(i * 2, c, i):
            p[j] = 0
        s = a + (-a) % i
        if s == i:
            s = i * 2
        for j in range(s, b + 1, i):
            q[j - a] = 0
    return q

# O(n^0.5)
def divisor(n: int) -> list:
    r = []
    for i in range(1, int(n ** 0.5) + 1):
        if n % i != 0:
            continue
        r.append(i)
        if i * i != n:
            r.append(n // i)
    return sorted(r)

# O(n^0.5)
def factorize(n: int) -> list:
    r = []
    for p in range(2, int(n ** 0.5) + 1):
        if n % p != 0:
            continue
        e = 0
        while n % p == 0:
            n //= p
            e += 1
        r.append((p, e))
    if n != 1:
        r.append((n, 1))
    return r

n = int(input())
pf = factorize(n)
xor = 0
for i in pf:
	xor ^= i[1]
print("Alice" if xor else "Bob")