#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using V = vector<ll>;
using VV = vector<V>;
using VVV = vector<VV>;
using VVVV = vector<VVV>;
using VVVVV = vector<VVVV>;
using VVVVVV = vector<VVVVV>;
using VS = vector<string>;
using VB = vector<bool>;
using P = pair<ll,ll>;
using M = map<ll,ll>;
using Q = queue<ll>;
using PQ = priority_queue<ll>;
using PQG = priority_queue<ll,V,greater<ll>>;
using S = set<ll>;
using VP = vector<P>;
constexpr ll MOD = 1000000007;
constexpr ll mod = 998244353;
constexpr ll INF = 1LL << 60;
#define rep(i,n) for(ll i = 0; i < n; i++)
#define rep2(i,s,n) for(ll i = s; i < n; i++)
#define per(i,n) for(ll i = n-1; i >= 0; i--)
#define per2(i,s,n) for(ll i = n-1; i >= s; i--)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define fix(x) cout<<fixed<<setprecision(x)
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return true;}return false;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return true;}return false;}
template<class T>void Vin(vector<T>&a){rep(i,(ll)a.size())cin>>a[i];}
template<class T>void VVin(vector<vector<T>>&a){rep(i,(ll)a.size())Vin(a[i]);}
template<class T>void Vout(const vector<T>&a){rep(i,(ll)a.size()-1)cout<<a[i]<<" ";cout<<a.back()<<'\n';}
template<class T>void Voutl(const vector<T>&a){rep(i,(ll)a.size())cout<<a[i]<<'\n';}
ll pow(ll a,ll b){ll res=1;while(b){if(b&1)res*=a;a*=a,b>>=1;}return res;}
ll mpow(ll a,ll b,const ll&M){a%=M;ll res=1;while(b){if(b&1)res=res*a%M;a=a*a%M,b>>=1;}return res;}
const ll H[4] = {0,1,0,-1}, W[4] = {1,0,-1,0};

ll f(ll a) {
    return min(a % 5 + a / 5, (10 - a) % 5 + (a + 4) / 5);
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    string n;
    cin >> n;
    n = "0" + n;
    ll len = n.size();
    VV dp(len + 1, V(2, INF));
    dp[len][0] = 0;
    per(i, len) {
        ll digit = n[i] - '0';
        rep(carry, 2) {
            ll upd = dp[i + 1][carry];
            if (upd == INF) continue;
            chmin(dp[i][0], upd + f(digit + carry));
            chmin(dp[i][1], upd + f(10 - digit - carry));
        }
    }
    cout << dp[0][0] << endl;
}