#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int INF = 1 << 29;

int arr[] = {0, 1, 2, 3, 4, 1, 2, 3, 4, 5};

string S;
int dp[10005][2];


int rec(int idx, bool pending)
{
  if(idx == -1) {
    if(pending != 0) return (INF);
    return (0);
  }
  if(~dp[idx][pending]) return (dp[idx][pending]);

  int ret = INF;
  for(int i = 0; i <= 9; i++) {
    auto need = i - pending < (S[idx] - '0');
    auto cost = arr[i] + arr[i - pending + (need ? 10 : 0) - (S[idx] - '0')];
    ret = min(ret, rec(idx - 1, need) + cost);
  }
  return (dp[idx][pending] = ret);
}

int main()
{

  cin >> S;
  S = "0" + S;
  memset(dp, -1, sizeof(dp));
  cout << rec(S.size() - 1, false) << endl;
}