from collections import Counter
def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

N = int(input())
P = Counter(prime_factorize(N))
ans = 1

for n,K in P.items():
  count = 0
  for k in range(K+1):
    count += n**k
  ans *= count
print(ans)