#!/usr/bin/env python3
mem = {0 : 0}
def solve(s):
    if s in mem: return mem[s]
    d = s%10
    a = 1e9
    if d <= 5: a = min(a, d + mem[s//10])
    if d >= 5: a = min(a, 10-d + mem[s//10 + 1])
    mem[s] = a
    return a

n = int(input())
l = [n]
while n:
    n//=10
    l.append(n)
for x in reversed(l):
    solve(x)
    solve(x+1)

print(solve(l[0]))