def solve(n):

    i = 2

    t = 0

    while n > 1:

        while n % i == 0:

            t += i

            n //= i

        i += 1

    return t

def factorSum(n):

    while n != solve(n):

        n = solve(n)

    return n

n = int(input())

print(factorSum(n))

def alo(n):
    global spf
    a = 0
    while n != 1:
        a += spf[n]
        n = n // spf[n]
    return a
limit = 10**6
spf = [1]*(limit + 1)
spf[0] = 0
for i in range(2, limit + 1):
    if spf[i] == 1:
        for j in range(i, limit + 1, i):
            if spf[j] == 1:
                spf[j] = i
n = int(input())
while not (spf[n] == n):
    n = alo(n)
print(n)