#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
template <typename T> using posteriority_queue = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
template <typename T> void unique(vector<T> &a) { a.erase(unique(ALL(a)), a.end()); }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  string s; cin >> s;
  reverse(ALL(s));
  int n = s.length();
  vector<vector<ll> > dp(n + 1, vector<ll>(2, LINF));
  dp[0][false] = 0;
  REP(i, n) {
    int val = s[i] - '0';
    REP(j, 10) REP(k, 10) {
      int coin = (j / 5 + j % 5) + (k / 5 + k % 5);
      if (j - k == val) chmin(dp[i + 1][false], dp[i][false] + coin);
      if (j + 10 - k == val) chmin(dp[i + 1][true], dp[i][false] + coin);
      if (j - 1 - k == val) chmin(dp[i + 1][false], dp[i][true] + coin);
      if (j - 1 + 10 - k == val) chmin(dp[i + 1][true], dp[i][true] + coin);
    }
  }
  cout << min(dp[n][false], dp[n][true] + 1) << '\n';
  return 0;
}