/** gnu specific **/
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/** contains everything I need in std **/
#include <bits/stdc++.h>

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(S) ((int)S.size())
#define FOR(i, st_, n) for(int i = st_; i < n; ++i)
#define RFOR(i, n, end_) for(int i = (n)-1; i >= end_; --i)
#define x first
#define y second
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef unsigned long long ull;
typedef long double LD;
typedef pair<ull, ull> pull;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
using namespace std;
#ifdef ONPC
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif


int solve()
{
	string s;
	if(!(cin>>s))return 1;
	for(auto& item: s) item-=1;
	int n =sz(s);
	const int DIG=9;
	vector<int> p(DIG);
	iota(all(p), 0);
	vector<vector<int>> D(DIG, vector<int>(DIG,0));
	vector<vector<int>> C(DIG, vector<int>(DIG,0));
	FOR(i,1,n)C[s[i]-'0'][s[i-1]-'0']+=1;
	vector<int> rp(DIG);
	ll res=1e9+47;
	do
	{
		FOR(i,0,DIG)rp[p[i]]=i;
		
		FOR(i,0,DIG)
			FOR(j,i+1,DIG)
				D[i][j]=D[j][i]=abs(rp[i]-rp[j]);

		ll cur_res=n+D[p[0]][s[0]-'0'];
		FOR(i,0,DIG)FOR(j,0,DIG) cur_res += D[i][j]*C[i][j];
		//FOR(i,1,n)cur_res += D[s[i]-'0'][s[i-1]-'0'];
		res=min(res,cur_res);
	} while(next_permutation(all(p)));
	cout<<res<<'\n';
    return 0;
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int TET = 1e9;
    //cin >> TET;
    for (int i = 1; i <= TET; i++)
    {
        if (solve())
        {
            break;
        }
#ifdef ONPC
        cout << "__________________________" << endl;
#endif
    }
#ifdef ONPC
    cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
#endif
}