#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <cstdlib>
#include <limits>
using namespace std;

typedef pair<int,int> PII;

const int INF = numeric_limits<int>::max()/3;

vector<string> kbd = {"QWERTYUIOP","ASDFGHJKL","ZXCVBNM"};
vector<PII> positions('Z'-'A'+1);


void preproc(){
    for(unsigned i=0; i<kbd.size();++i)
        for(unsigned j=0;j<kbd[i].size();++j)
            positions[kbd[i][j]-'A'] = PII(i,j);
}

int dist(int a, int b){
    return abs(positions[a].first-positions[b].first) +
           abs(positions[a].second-positions[b].second);
}



int main()
{
    preproc();

    string s;
    cin>>s;

    vector<vector<int>> cost('Z'-'A'+1, vector<int>('Z'-'A'+1,INF));
    cost['F'-'A']['J'-'A']=0;

    for(unsigned t=0;t<s.size();++t){
        int c = s[t]-'A';
        vector<vector<int>> costnext('Z'-'A'+1, vector<int>('Z'-'A'+1,INF));
        
        for(int i=0;i<'Z'-'A'+1; ++i){
            for(int j=0;j<'Z'-'A'+1; ++j){
                costnext[i][c] = min(
                            costnext[i][c],
                            cost[i][j]+dist(j,c)
                        ); 
                costnext[c][j] = min(
                            costnext[c][j],
                            cost[i][j]+dist(i,c)
                        ); 
            }
        }
         
        costnext.swap(cost);
    }

    int mn=INF;
    for(int i=0;i<'Z'-'A'+1; ++i){
        for(int j=0;j<'Z'-'A'+1; ++j){
            mn = min(mn,cost[i][j]);
        }
    }

    cout<<mn<<'\n';
}