#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
#define ll long long
template<typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long double ld;


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

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll N = 1e5 + 5, M = 1e4 + 5, MOD = 998244353, LOG = 20, Msk = 21, pw1 = 31, pwe2 = 37;

ll fp(ll num , ll pw){
    if(pw == 0)
        return 1;
    ll half = fp(num , pw/2);
    ll ans = half * half;
    if(pw & 1)
        ans *= num;
    return ans;
}
map<char,int>ps;
string s;
map<pair<char,char>,int>mp;
ll fans(int sz,char fr){
    if(sz==9){
        ll cnt=abs(ps[fr]-ps[s[0]]);
        for(auto it : mp){
            char a=it.first.first,b=it.first.second;
            cnt+=abs(ps[a]-ps[b])*it.second;
        }
        return cnt;
    }
    ll cur=1e18;
    for(int i=1;i<10;i++){
        if(!ps['0'+i]){
           ps['0'+i]=sz+1;
           if(sz==0)
               fr='0'+i;
          cur=min(cur,fans(sz+1,fr))  ;
            ps['0'+i]=0;
        }

    }
    return cur;
}
void testCase() {
   cin>>s;
   for(int i=1;i<s.size();i++){
       mp[{s[i-1],s[i]}]++;
   }
    cout << fans(0,0)+s.size();

}

signed main() {

    lmao
    int t = 1;
//    cin >> t;
    while (t--)
        testCase();
}