import sys
input = sys.stdin.read

n = int(input())
a = [2 * 10**9] * (n + 1)  # 初始化数组，a[0] = 2e9，相当于无穷大

a[1] = 1
a[2] = 2

for i in range(3, n + 1):
    a[i] = 2 * 10**9  # 设置为无穷大
    for j in range(1, i):
        if j > i - j:
            break
        a[i] = min(a[i], a[j] + a[i - j])
        if i % j == 0:
            k = i // j
            a[i] = min(a[i], a[j] + a[k])

    ji = 10
    for k in range(1, 6):  # k 从 1 到 5
        aa = i % ji
        bb = i // ji
        if ji == 100 and aa < 10:
            continue
        if ji == 1000 and aa < 100:
            continue
        if ji == 10000 and aa < 1000:
            continue
        a[i] = min(a[i], a[aa] + a[bb])
        ji *= 10

print(a[n])