#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>

#define MAXN 5000005
#define MAXS 10
#define ll long long

using namespace std;

int n, a[MAXS][MAXS], p[9], mul[MAXS][MAXS];

void solve() {
    string s;
    cin >> s;
    int pre, post;
    for (int i = 0; i < s.size() - 1; ++i) {
        pre = s[i] - '0';
        post = s[i + 1] - '0';
        if (pre == post) continue;
        ++a[min(pre, post)][max(pre, post)];
    }

    for (int i = 0; i < 9; ++i) p[i] = i + 1;

    
    int x, y, mini = 1000000000;
    while (next_permutation(p, p + 9)) {
        int ans = 0;

        for (int i = 0; i < 8; ++i) {
            for (int j = i + 1; j < 9; ++j) {
                x = p[i];
                y = p[j];
                mul[min(x, y)][max(x, y)] = j - i;
            }
        }

        for (int i = 1; i <= 8; ++i) {
            for (int j = i + 1; j <= 9; ++j) {
                ans += mul[i][j] * a[i][j];
            }
        }

        if (p[0] != (s[0] - '0')) ans += mul[min(p[0], (s[0] - '0'))][max(p[0], (s[0] - '0'))];

        mini = min(mini, ans);
    }
    
    cout << mini + s.size() << endl;
}

int main() {

    int _ = 1;
    //cin >> _;
    while(_--) {
        solve();
    }
    return 0;
}