c=97;s=0
for i in map(ord,input()):
x=abs(c-i)
s+=min(x,26-x)
c=i
print(s)
#include <bits/stdc++.h>
using namespace std;
int main() {
string s; cin >> s;
char pos = 'a';
int sol = 0;
for (int i = 0; i < s.size(); ++i) {
sol += min(abs(pos - s[i]), 26 - abs(pos - s[i]));
pos = s[i];
}
cout << sol << "\n";
}
515A - Drazil and Date | 1084B - Kvass and the Fair Nut |
1101A - Minimum Integer | 985D - Sand Fortress |
1279A - New Year Garland | 1279B - Verse For Santa |
202A - LLPS | 978A - Remove Duplicates |
1304A - Two Rabbits | 225A - Dice Tower |
1660D - Maximum Product Strikes Back | 1513A - Array and Peaks |
1251B - Binary Palindromes | 768B - Code For 1 |
363B - Fence | 991B - Getting an A |
246A - Buggy Sorting | 884A - Book Reading |
1180A - Alex and a Rhombus | 445A - DZY Loves Chessboard |
1372A - Omkar and Completion | 159D - Palindrome pairs |
981B - Businessmen Problems | 1668A - Direction Change |
1667B - Optimal Partition | 1668B - Social Distance |
88B - Keyboard | 580B - Kefa and Company |
960A - Check the string | 1220A - Cards |