#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <cstring>
#define mp make_pair
#define pb push_back
#define LL long long
#define inf 2e9
#define zeros x^(x-1)&x
using namespace std;

int dp[101][27][27],n,mn;
char s[101];
string A = "QWERTYUIOP";
pair<int,int> poz[256];


int _abs(int x)
{
    if (x<0)
        return -x;
    return x;
}


int dist(int L,int R)
{
    return _abs(poz[L].first - poz[R].first)+_abs(poz[L].second-poz[R].second);
}
int main()
{
    cin>>s+1;
    n=strlen(s+1);

    for (int i=0;i<A.size();i++)
        poz[A[i]-'A'] = make_pair(1,i);
    A = "ASDFGHJKL";
    for (int i=0;i<A.size();i++)
        poz[A[i]-'A'] = make_pair(2,i);
    A = "ZXCVBNM";
    for (int i=0;i<A.size();i++)
        poz[A[i]-'A'] = make_pair(3,i);

    mn = inf;

   for (int R = 0;R<26;R++)
        for (int L = 0;L<26;L++)
        {
            dp[0][R][L] = inf;
        }


    dp[0]['J'-'A']['F' - 'A'] = 0;
    for (int i=1;i<=n;i++)
    {

        for (int R = 0;R<26;R++)
            for (int L = 0;L<26;L++)
            {
                dp[i][R][L] = inf;
            }

        for (int R = 0;R<26;R++)
            for (int L = 0;L<26;L++)
            {
                dp[i][R][s[i]-'A'] = min(dp[i][R][s[i]-'A'],dp[i-1][R][L] + dist(L,s[i]-'A'));
                dp[i][s[i]-'A'][L] = min(dp[i][s[i]-'A'][L],dp[i-1][R][L] + dist(R,s[i]-'A'));
                if (i==n)
                {
                    mn = min(mn,dp[i][R][s[i]-'A']);
                    mn = min(mn,dp[i][s[i]-'A'][L]);
                }
            }
    }

    cout<<mn;


    return 0;
}