#include <bits/stdc++.h>

#define el '\n'
#define ll long long
#define ld long double

#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

int solve(string &s, string &t) {
    int ret = 0;

    int p[10];

    for (int i = 0; i < 9; i++)
        p[t[i] - '0'] = i;

    int lst = 0;

    for (auto &i: s)
        ret += abs(lst - p[i - '0']), lst = p[i - '0'];

    return ret;
}

void testCase() {
    string s;
    cin >> s;

    string t = "123456789";

    int sol = 1e9;

    do {
        sol = min(sol, solve(s, t));
    } while (next_permutation(t.begin(), t.end()));

    cout << sol + s.size();
}

signed main() {
    Beevo

    int T = 1;
//    cin >> T;

    while (T--)
        testCase();

    return 0;
}