#include<bits/stdc++.h>
using namespace std; 
typedef long long ll;
string K[] = {"QWERTYUIOP","ASDFGHJKL","ZXCVBNM"},S;
struct my{int x,y;} P[300],f,s,p;
int d(my a,my b){return abs(a.x-b.x)+abs(a.y-b.y);}

int back(my f,my s,int k,int c){
	if(k >= S.length()) return c;
	my p = P[S[k]];
	if(d(f,p) == d(s,p)) return min(back(p,s,k+1,c+d(f,p)),back(p,f,k+1,c+d(f,p)));
	if(d(f,p) < d(s,p)) c+=d(f,p),f = p;
	else c+=d(s,p), s = p;
	return back(f,s,k+1,c); 
} 

int main(){
    cin >> S;
    for(int i = 0;i<3;i++)
        for(int j = 0;j<K[i].length();j++) P[K[i][j]] = {i+1,j+1};
    cout << back(P['F'],P['J'],0,0);
}