import sys

sys.setrecursionlimit(7000)

N = int(input())

bests = {0 : 0, 1 : 1}

def get_best(k):
    if k in bests:
        return bests[k]
    if k % 10 == 0:
        return get_best(k // 10)
    op1 = get_best(k // 10) + (k % 10)
    op2 = get_best(k // 10 + 1) + (10 - (k % 10))
    b = min(op1, op2)
    bests[k] = b
    return b

print(get_best(N))