#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

char s[12525];
int n;
int dp[2][12525]; // = min coin
int coin[] = {0, 1, 2, 3, 4, 1, 2, 3, 4, 5, 2};

int main(){
  s[0]='0';
  scanf("%s",s+1);
  n = strlen(s);
  REP(i,2)REP(j,12525)dp[i][j] = 252521;
  dp[0][0] = 0;
  REP(i,n)REP(j,2){
    int x = s[n-1-i]-'0';
    REP(d,10){
      int to = d+j<x;
      int add = coin[d] + coin[(d-j>=x ? d-x-j : 10-j-(x-d))];
      CHMIN(dp[to][i+1],dp[j][i]+add);
    }
  }
  printf("%d\n",dp[0][n]);
  return 0;
}