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())
c = Counter(prime_factorize(n)).most_common()
ans = 1
for i in c:
    cnt = 0
    for j in range(i[1] + 1):
        cnt += i[0] ** j
    ans *= cnt
print(ans)