from math import inf


def make_divisors(n):
    lower_divisors, upper_divisors = [], []
    i = 1
    while i * i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n // i)
        i += 1
    return lower_divisors + upper_divisors[::-1]


def main():
    n = int(input())
    dp = [inf] * (n + 1)
    dp[1] = 0
    for i in make_divisors(n):
        for k in range(1, n // i + 1):
            dp[i * k] = min(dp[i] + k, dp[i * k])
    print(dp[n])


if __name__ == "__main__":
    main()