#include <iostream>

#include <cstdio>

#include <cstring>

#include <algorithm>

#define N 18

#define INF 1<<30

using namespace std;

char ch[N];

int len,dp[<<N][N],ALL;

//int up[1<<N][N];

/*

int abs(int a,int b)

{

    if (a>b) return a-b;

    else  return b-a;

}

*/

int diff(int a, int b) //这个函数和下面的函数都是计算转换字符的按键数，结果下面那个是错的，原因是在计算从Z字母转换过去的时候，下面那个算错了，没照顾到a在b的后面的情况。为了这个BUG我检查了好久 真不应该啊

{

    int ans=abs(a-b);

    return min(ans,'Z'-'A'-ans+);

}

int ccounts(char a,char b)

{

    int asc1=a-'A';

    int asc2=b-'A';

    int z='Z'-'A';

    int press=abs(asc1-asc2);

    press=min((press),z-asc2++asc1);

    return press;

}

/*

void solve(int s,int d)

{

    if (d==len) return;

    //if (vis[s]) return;

    vis[s]=1;

    if (dp[ALL]<=dp[s]) return;

    for (int i=0; i<len; i++)

    {

        if ((1<<i)&s) continue;

        int nt=s+(1<<i);

        int tmp;

        //cout<<"p1"<<endl;

        //if (up[s][i]==0)

         //up[s][i]=counts(i,s,ch[i]);

        tmp=dp[s]+counts(i,s,ch[i]);

        //cout<<"p2"<<endl;

        //cout<<tmp<<endl;

        if (dp[nt]>tmp)

        {

            dp[nt]=tmp;

            mouse[nt]=i+1;

            action[nt]=ch[i]-'A';

            solve(nt,d+1);

        }

        else

        if (vis[nt]==0)

         solve(nt,d+1);

        //cout<<"p3"<<endl;

        //cout<<dp[nt]<<endl;

    }

}

*/

int solve (int s,int last) //记忆化搜索

{

    if (dp[s][last]) return dp[s][last];

    if (s==) return ;

    dp[s][last]=INF;

    int pos=;

    for (int i=;i<=last;i++)

    {

        if ((<<i)&s) pos++;

    }

    for (int i=,j=;i<len;i++)

    {

        if ((<<i)&s)

        {

            j++;

            if (j==pos) continue;

            int cur= j>pos? j-pos:pos-j-;

            int rng=diff(ch[i],ch[last]);

            dp[s][last]=min(dp[s][last],+cur+rng+solve(s^(<<last),i));

        }

    }

    return dp[s][last];

}

int main()

{

    //init();

    while (scanf("%s",ch))

    {

        len=strlen(ch);

        if (len== && ch[]=='') break;

        memset(dp,,sizeof dp);

        ALL=<<len;

        ALL--;

        for (int i=;i<len;i++)

        {

            dp[<<i][i]=diff('A',ch[i])+;

        }

        int ans=INF;

        for (int i=;i<len;i++){

           ans=min(ans,solve(ALL,i));

        }

        printf("%d\n",ans);

    }

    return ;

}