import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write

N=list(map(int,list(readline().rstrip())))
le=len(N)
inf=1<<60
cnt=[0,1,2,3,4,1,2,3,4,5,1]
@lru_cache(maxsize=None)
def solve(i,x):
    xx=x
    if i==0:
        retu=x
    else:
        n=N[i-1]+x
        x=n//10
        n%=10
        retu=inf
        retu=min(retu,solve(i-1,1+x)+cnt[10-n])
        if n<=5:
            retu=min(retu,solve(i-1,x)+1+cnt[5-n])
        retu=min(retu,solve(i-1,x)+cnt[n])
        if n>5:
            retu=min(retu,solve(i-1,x+1)+cnt[n-5]+1)
    return retu
ans=solve(le,0)
print(ans)