#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
int MOD = 1000000007;
int dp[10005][2];
int a1[11] = { 0,1,2,3,2,1,2,3,3,2,1 };
//int a2[11] = { 0,1,2,3,4,1,2,3,4,5,1 };
signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	string S;
	cin >> S;
	while (S.back() == '0') {
		S.pop_back();
	}
	int N = S.size();
	dp[0][0] = 0;
	dp[0][1] = 1;
	for (int i = 0; i < N; i++) {
		dp[i + 1][0] = dp[i][0] + a1[S[i] - '0'];
		dp[i + 1][0] = min(dp[i + 1][0], dp[i][1] + a1[10 - (S[i] - '0')]);
		dp[i + 1][1] = dp[i][0] + a1[1 + (S[i] - '0')];
		dp[i + 1][1] = min(dp[i + 1][1], dp[i][1] + a1[9 - (S[i] - '0')]);
		
	}
	/*for (int i = 0; i <= N; i++) {
		cerr << dp[i][0] << " ";
	}
	cerr << endl;
	for (int i = 0; i <= N; i++) {
		cerr << dp[i][1] << " ";
	}
	cerr << endl;*/
	cout << dp[N][0] << endl;
}