n = int(input())

def prime_factorize(N): #素因数分解
    exponent = 0
    while N%2 == 0:
        exponent += 1
        N //= 2
    if exponent: factorization = [[2,exponent]]
    else: factorization = []
    i=1
    while i*i <=N:
        i += 2
        if N%i: continue
        exponent = 0
        while N%i == 0:
            exponent += 1
            N //= i
        factorization.append([i,exponent])
    if N!= 1: factorization.append([N,1])
    assert N != 0, "zero"
    return factorization

fac = prime_factorize(n)

if n==1: print(1)
else:
    ans = 1
    for p,e in fac:
        x = 0
        c = 1
        for i in range(e+1):
            x += c
            c *= p
        ans *= x
    
print(ans)