#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

string s;
int dp[10003][2], INF = 1e6;

int f(int a) {
	assert(inII(a, 0, 9));
	return a / 5 + a % 5;
}

int main() {
	cin >> s;
	s = "0" + s;
	
	int n = s.size();
	incII(i, 0, n) {
	inc(j, 2) {
		dp[i][j] = INF;
	}
	}
	dp[0][0] = 0;
	
	inc(i, n) {
		inc(j, 10) {
			int c = (s[i] - '0');
			if(j < c) {
				setmin(dp[i + 1][0], dp[i][1] + f(j) + f(10 + j - c));
			} else {
				setmin(dp[i + 1][0], dp[i][0] + f(j) + f(     j - c));
			}
		}
		inc(j, 10) {
			int c = (s[i] - '0') + 1;
			if(j < c) {
				setmin(dp[i + 1][1], dp[i][1] + f(j) + f(10 + j - c));
			} else {
				setmin(dp[i + 1][1], dp[i][0] + f(j) + f(     j - c));
			}
		}
	}
	
	cout << dp[n][0] << endl;
	
	return 0;
}