#include<cmath>
#include<cstdio>
#include<string>
#include<iostream>
#include<algorithm>
using namespace std;

int m(int a, int b, int x, int y){
    return abs(a - x) + abs(b - y);
}
int lx,ly,rx,ry, ans;
pair<int, int> k[27];
string s;

int main(){

k['A' - 'A'] = {2, 1};
k['B' - 'A'] = {3, 5};
k['C' - 'A'] = {3, 3};
k['D' - 'A'] = {2, 3};
k['E' - 'A'] = {1, 3};
k['F' - 'A'] = {2, 4};
k['G' - 'A'] = {2, 5};
k['H' - 'A'] = {2, 6};
k['I' - 'A'] = {1, 8};
k['J' - 'A'] = {2, 7};
k['K' - 'A'] = {2, 8};
k['L' - 'A'] = {2, 9};
k['M' - 'A'] = {3, 7};
k['N' - 'A'] = {3, 6};
k['O' - 'A'] = {1, 9};
k['P' - 'A'] = {1, 10};
k['Q' - 'A'] = {1, 1};
k['R' - 'A'] = {1, 4};
k['S' - 'A'] = {2, 2};
k['T' - 'A'] = {1, 5};
k['U' - 'A'] = {1, 7};
k['V' - 'A'] = {3, 4};
k['W' - 'A'] = {1, 2};
k['X' - 'A'] = {3, 2};
k['Y' - 'A'] = {1, 6};
k['Z' - 'A'] = {3, 1};

lx = 2;
ly = 4;

rx = 2;
ry = 7;

cin >> s;

for(int i = 0; i < s.length(); i++){
    int m1 = m(lx, ly, k[s[i] - 'A'].first, k[s[i] - 'A'].second);
    int m2 = m(rx, ry, k[s[i] - 'A'].first, k[s[i] - 'A'].second);

    if(m1 < m2){
        ans += m1;
        lx = k[s[i] - 'A'].first;
        ly = k[s[i] - 'A'].second;
    }else{
        ans += m2;
        rx = k[s[i] - 'A'].first;
        ry = k[s[i] - 'A'].second;
    }
}printf("%d", ans);

return 0;
}