#include #include #include #include #include using namespace std; pair f[27]; string s; int dist(int x, int y) { return abs(f[x].first - f[y].first) + abs(f[x].second - f[y].second); } int main() { f['Q'-'A'] = make_pair(1, 1); f['W' - 'A'] = make_pair(1, 2); f['E' - 'A'] = make_pair(1, 3); f['R' - 'A']= make_pair(1, 4); f['T' - 'A'] = make_pair(1, 5); f['Y' - 'A']= make_pair(1, 6); f['U' - 'A']= make_pair(1, 7); f['I' - 'A']= make_pair(1, 8); f['O' - 'A'] = make_pair(1, 9); f['P' - 'A']= make_pair(1, 10); f['A' - 'A']= make_pair(2, 1); f['S' - 'A']= make_pair(2, 2); f['D' - 'A']= make_pair(2, 3); f['F' - 'A'] = make_pair(2, 4); f['G' - 'A']= make_pair(2, 5); f['H' - 'A']= make_pair(2, 6); f['J' - 'A']= make_pair(2, 7); f['K' - 'A']= make_pair(2, 8); f['L' - 'A']= make_pair(2, 9); f['Z' - 'A']= make_pair(3, 1); f['X' - 'A']= make_pair(3, 2); f['C' - 'A']= make_pair(3, 3); f['V' - 'A']= make_pair(3, 4); f['B' - 'A']= make_pair(3, 5); f['N' - 'A']= make_pair(3, 6); f['M' - 'A']= make_pair(3, 7); cin >> s; int p = 'J' - 'A'; int q = 'F' - 'A'; int rez = 0; for (int i= 0; i < s.size(); ++i) { if (dist(p, s[i] - 'A') < dist(q, s[i] - 'A')) { rez += dist(p, s[i] - 'A'); p = s[i] - 'A'; } else { rez += dist(q, s[i] - 'A'); q = s[i] - 'A'; } } cout << rez; return 0; }