#include <bits/stdc++.h>

#define sz(x)  (int)x.size()
#define bigint __int128
#define el '\n'
#define ll long long
#define int long long
#define ld long double
using namespace std;
const int N = 1e5 + 4, M = 1e5 + 10, mod = 998244353;
int arr[9][9];

long long calc(vector<int> &v) {
    int n = 9;
    long long ans = 0;
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            int x = v[i], y = v[j];
            ans += arr[x][y] * (j - i + 1);
        }
    }
    return ans;
}

void acc() {
    string s;
    cin >> s;
    vector<int> v(9);
    for (int i = 0; i < 9; i++)v[i] = i + 1;
    int n = sz(s);
    vector<int> num(n);
    for (int i = 0; i < n; i++) {
        num[i] = s[i] - '0';
    }
    for (int i = 0; i < n - 1; i++) {
        int mn = min(num[i], num[i + 1]), mx = max(num[i], num[i + 1]);
        arr[mn][mx]++;
        arr[mx][mn]++;
    }
    long long mn = 1e9;
    do {
        long long ret = calc(v);
        int id = -1;
        for (int i = 0; i < 9; i++) {
            if (v[i] == num[0]) {
                id = i;
                break;
            }
        }
        ret += id + 1;
        //  cout << id << el;
        mn = min(mn, ret);
    } while (next_permutation(v.begin(), v.end()));
    cout << mn << el;


}

signed main() {
//    cout.tie(0);
//    cin.tie(0);
//    ios_base::sync_with_stdio(0);
    int t = 1;
    // cin >> t;
    while (t--)acc();
}