#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

string S,T;
int N;

int A[101010],B[101010];

int BB(int d);

int AA(int d) {
	if(d>=N) return 0;
	if(A[d]>=0) return A[d];
	if(d==N-1) {
		if(S[d]>='5') return min(2+'9'-S[d],S[d]-'4');
		else if(S[d]>='1') return min(S[d]-'0',2+'4'-S[d]);
		return 0;
	}
	
	int ret=101010;
	
	if(S[d]>='5') ret=min(ret,S[d]-'4'+AA(d+1));
	ret=min(ret,S[d]-'0'+AA(d+1));
	if(S[d]>='5') ret=min(ret,1+'9'-S[d]+BB(d+1));
	else if(S[d]>='1') ret=min(ret,1+'4'-S[d]+BB(d+1));
	else if(S[d]>='0') ret=min(ret,1+BB(d+1));
	
	return A[d]=ret;
}

int BB(int d) {
	if(d>=N) return 0;
	if(B[d]>=0) return B[d];
	if(d==N-1) {
		if(T[d]>='5') return min(2+'9'-T[d],T[d]-'4');
		else if(T[d]>='1') return min(T[d]-'0',2+'4'-T[d]);
		return 0;
	}
	
	int ret=101010;
	
	if(T[d]>='5') ret=min(ret,T[d]-'4'+BB(d+1));
	ret=min(ret,T[d]-'0'+BB(d+1));
	if(T[d]>='5') ret=min(ret,1+'9'-T[d]+AA(d+1));
	else if(T[d]>='1') ret=min(ret,1+'4'-T[d]+AA(d+1));
	else if(T[d]>='0') ret=min(ret,1+BB(d+1));
	
	return B[d]=ret;
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>S;
	while(S.back()=='0') S.pop_back();
	N=S.size();
	
	T=S;
	int carry=0;
	for(i=N-1;i>=0;i--) {
		if(carry==0) {
			if(T[i]!='0') {
				carry=1;
				T[i]='0'+(10-(T[i]-'0'));
			}
		}
		else {
			T[i]='0'+(9-(T[i]-'0'));
		}
	}
	
	MINUS(A);
	MINUS(B);
	
	cout<<AA(0)<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}