#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
const int INF=1e9+7;
int main()
{
	string s; cin>>s;
	s='0'+s;
	vector<int> v;
	for(int i=(int)s.size()-1; i>=0; i--){
		int d=s[i]-'0';
		if(d>=5){
			v.push_back(d-5);
			v.push_back(1);
		}else{
			v.push_back(d);
			v.push_back(0);
		}
	}
	reverse(v.begin(), v.end());
	int n=v.size();
	int dp[2][20020];
	dp[0][0]=0;
	dp[1][0]=INF;
	for(int i=1; i<n; i++){
		dp[0][i]=min(dp[1][i-1]+1, dp[0][i-1])+v[i];
		int d=2;
		if(i&1) d=5;
		dp[1][i]=min(dp[1][i-1], dp[0][i-1]+1)+d-1-v[i];
	}
	cout<<min(dp[0][n-1], dp[1][n-1]+1)<<endl;
	return 0;
}