#include <bits/stdc++.h>

using ll = long long;
using namespace std;

ll dp[1010][2];
ll a[1010];
int chk[1010];
int n;

ll solve(int i, int k){
    if(dp[i][k] ^ -1) return dp[i][k];
    ll s = a[i];
    if(!chk[i]){
        if(k) dp[i][k] = 10 - s;
        else dp[i][k] = s;
        return dp[i][k];
    }

    if(k) {
        s = (10 - s) % 10;
        s--;
    }
    return dp[i][k] = min(solve(i + 1, k), solve(i + 1, k ^ 1) + 1) + s;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    string s; cin>>s;
    n = s.size();
    for(int i = 0; i < n; i++) a[i] = s[i] - '0';
    for(int i = 0; i < n; i++) for(int k = 0; k < 2; k++) dp[i][k] = -1;
    for(int k = n - 1; k >= 1; k--) if(a[k] || chk[k]) chk[k - 1] = 1;
    cout << min(solve(0, 0), solve(0, 1) + 1);
}