/*
     Hell, 'til I reach Hell, I ain't scared
     Mama checkin' in my bedroom, I ain't there
                                                */
    #include<bits/stdc++.h>
    #include <ext/pb_ds/assoc_container.hpp>
    #include <ext/pb_ds/tree_policy.hpp>
    using namespace __gnu_pbds;
    using namespace std;

    #define Major  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #define TxtIO   freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
    #define read(a,n) for(int i = 0 ; i<n ; i++) cin>>a[i];
    #define write(a) for(auto x : a) cout<<x<<" ";
    #define int long long
    #define pb push_back
    #define all(a)  a.begin(),a.end()
    #define el "\n"

    typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

    const int inf=4e18;

    int dx[]={1,0,-1,0,1,1,-1,-1};
    int dy[]={0,1,0,-1,1,-1,1,-1};

    const int mod=1e9+7;
    const int MAX =2e5+7;

    //---------------------------Function----------------------------------//
    void TestCake(){
        string s;cin>>s;
        vector<int>arr={1,2,3,4,5,6,7,8,9};
        int cnt[11][11]={0};
        for(int i=0;i<s.size()-1;i++){
            cnt[s[i]-'0'][s[i+1]-'0']++;
        }

        int last=inf;
        do{
          int mp[11]={0};
          for(int i=0;i<9;i++){
             mp[arr[i]]=i;
          }
          int ans=mp[s[0]-'0']+1;
          for(int i=1;i<10;i++){
            for(int j=1;j<10;j++){
                ans+=cnt[i][j]*(abs(mp[i]-mp[j])+1);
            }
          }
          last=min(last,ans);
        }while(next_permutation(all(arr)));
        cout<<last<<el;
    }
    //------------------------------Main---------------------------//
    signed main(){
        Major
        int T = 1;
//        cin >> T;
        while(T--){
            TestCake();
        //       cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
        }
        return 0;
    }