N = int(input())

def factorize(n):
    
    def divisibility(n, m):
        c = 0
        while n % m == 0:
            c += 1
            n /= m
        return c, n

    divisors = []
    c, m = divisibility(n, 2)
    if 0 < c:
        divisors.append((2, c))
    c, m = divisibility(m, 3)
    if 0 < c:
        divisors.append((3, c))
    x = 5
    while x * x <= m:
        c, m = divisibility(m, x)
        if c > 0:
            divisors.append((x, c))
        if x % 6 == 5:
            x += 2
        else:
            x += 4
    if 1 < m:
        divisors.append((m, 1))
    return divisors

def sum_divisors(p, n):
    a = 0
    while n > 0:
        a += p ** n
        n -= 1
    return a + 1

if N % 2 == 0:
    N /= 2

a = 1
for p, q in factorize(N):
    a *= sum_divisors(p, q)

print(a)