#include <bits/stdc++.h>
#define int long long
using namespace std;


void solve() {
    string s; cin >> s;
    vector<vector<int>> cnts(10, vector<int>(10, 0));
    int mincost = LONG_MAX;
    for(int i = 0; i < s.length() - 1; i++) {
        cnts[s[i] - '0'][s[i+1] - '0']++;
    }
    vector<int> nums = {1, 2, 3, 4, 5, 6, 7, 8, 9};
    map<int, int> mp;

    // for (int i = 1; i < 10; i++) {
    //     for (int j = 1; j < 10; j++) {
    //         cout << cnts[i][j] << " ";
    //     }
    //     cout << "\n";
    // }
    
    do {
        // for (int i = 0; i < 9; ++i) {
        //     cout << nums[i] << " ";
        // }
        // cout << '\n';
        for (int i = 0; i < 9; ++i) {
            mp[nums[i]] = i;
        }
        // for (int i = 1; i <= 9; ++i) {
        //     cout << mp[i] << " ";
        // }
        // cout << '\n';
        int cur = s.length();
        for (int i = 1; i < 10; i++) {
            for (int j = 1; j < 10; j++) {
                cur += cnts[i][j] * (abs(mp[i] - mp[j]) + (i == j));
                // if (cnts[i][j] != 0) {
                //     cout << i << ' ' << j << '\n';
                //     cout << cnts[i][j] * (abs(mp[i] - mp[j]) + (i == j)) << '\n';
                // }
            }
        }
        // cout << s[0] << "\n";
        cur += mp[s[0]] + 1;
        // cout << mp[7] << mp[s[0]] << "\n";
        mincost = min(mincost, cur);
    } while (next_permutation(nums.begin(), nums.end()));

    cout << mincost << "\n";
    return;
}


signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}