import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int L;
string S;

void main() {
  try {
    for (; ; ) {
      S = readToken();
      L = cast(int)(S.length);
      
      /*
        B x + y = B x + y = B (x + 1) - (B - y)
        B' - (B x + y) = B (b - x) - y = B (b - x - 1) + (B - y)
      */
      auto dp = new int[][](L * 2 + 1, 2);
      dp[0][0] = 0;
      dp[0][1] = 1;
      foreach (i; 0 .. L * 2) {
        int b, x;
        if (i % 2 == 0) {
          b = 5;
          x = (S[L - 1 - i / 2] - '0') % 5;
        } else {
          b = 2;
          x = (S[L - 1 - i / 2] - '0') / 5;
        }
        assert(0 <= x && x < b);
        dp[i + 1][0] = min(dp[i][0] + x, dp[i][1] + (x + 1));
        dp[i + 1][1] = min(dp[i][0] + (b - x), dp[i][1] + (b - x - 1));
      }
      const ans = min(dp[L * 2][0], dp[L * 2][1] + 1);
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}