//#pragma GCC optimize("Ofast", "unroll-loops")
//#pragma GCC target("sse", "sse2", "sse3", "ssse3", "sse4")
#ifdef LOCAL
#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>
#else
#include <bits/stdc++.h>
#endif

#define all(a) a.begin(),a.end()
#define len(a) (int)(a.size())
#define mp make_pair
#define pb push_back
#define fir first
#define sec second
#define fi first
#define se second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;

template<typename T>
inline bool umin(T &a, T b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<typename T>
inline bool umax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

#ifdef LOCAL
#define D for (bool _FLAG = true; _FLAG; _FLAG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl
template <class ...Ts> auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }
#else
#define D while (false)
#define LOG(...)
#endif // LOCAL

const int max_n = -1, inf = 1000111222;



int main() {
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    string s;
    cin >> s;
    reverse(all(s));
    s.pb('0');
    s.pb('0');
    reverse(all(s));
    int n = len(s);
    int dp[2][2] = {};
    for (int i = 0; i < 2; i++) {
        dp[i][0] = inf;
        dp[i][1] = inf;
    }
    dp[0][1] = 0;
    for (int i = n - 1; i >= 0; i--) {
        int cur = s[i] - '0';
        int new_dp[2][2] = {};
        for (int i = 0; i < 2; i++) {
            new_dp[i][0] = inf;
            new_dp[i][1] = inf;
        }
        for (int carry = 0; carry < 2; carry++) {
            for (int f = 0; f < 2; f++) {
                for (int val = 0; val < 10; val++) {
                    int t = f;
                    if (val > cur) {
                        t = 1;
                    }
                    else if (val < cur) {
                        t = 0;
                    }
                    int cur_val = val - cur - carry;
                    int need = 0;
                    if (cur_val < 0) {
                        need = 1;
                        cur_val += 10;
                    }
                    umin(new_dp[need][t], dp[carry][f] + val + cur_val);
                }
            }
        }
        for (int i = 0; i < 2; i++) {
            dp[i][0] = new_dp[i][0];
            dp[i][1] = new_dp[i][1];
            new_dp[i][0] = inf;
            new_dp[i][1] = inf;
        }
    }
    cout << dp[0][1] << '\n';
}