#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <array>
#include <climits>
// #pragma GCC optimize ("O3")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
typedef long long ll;
typedef long double ld;
using namespace std;
const int N = 1e3 + 5;
const int M = 1e5 + 5;
const int MOD = 998244353;

int n, dis[14][14], freq[14][14];
string s;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    // cout.tie(nullptr);

    cin >> s;
    n = s.size();
    for (int i = 1; i < n; ++i) {
        freq[s[i - 1] - '0'][s[i] - '0']++;
    }
    vector<int> perm(9);
    iota(perm.begin(), perm.end(), 1);
    ll ans = LLONG_MAX;
    do {
        for (int i = 0; i < 9; ++i) {
            for (int j = 0; j < 9; ++j) {
                dis[perm[i]][perm[j]] = abs(i - j);
            }
        }
        ll cur_ans = n + dis[perm[0]][s[0] - '0'];
        for (int i = 1; i <= 9; ++i) {
            for (int j = 1; j <= 9; ++j) {
                cur_ans += 1ll * freq[i][j] * dis[i][j];
            }
        }
        ans = min(ans, cur_ans);
    } while (next_permutation(perm.begin(), perm.end()));
    cout << ans << '\n';
    return 0;
}