int solution(string name) {
    int answer = 0;
    
    vector<int> cnts;    
    for(int i = 0 ; i < name.length(); ++i){
        cnts.push_back(name[i] - 'A');
        answer += min ( name[i]-'A', 'Z'- name[i]+1 );    
    }
    int idx = 0;
    
    int forward = 0;
    for(int i = 1 ; i < cnts.size() ; ++i){
        if(cnts[i] != 0){
            if ( (i-idx) <= cnts.size() - i){
                forward += i -idx;
                idx = i ;   
            }    
            else{
                forward += cnts.size()-i;
                idx = i;
            }
        }
    }
    
    idx = cnts.size()-1; 
    int backward = 1;
    for(int i = cnts.size()-1 ; i > 0 ; --i){
        if(cnts[i] != 0){
            if ( (idx-i) <= cnts.size() - i){
                backward += idx-i;
                idx = i ;   
            }    
            else{
                backward += cnts.size()-i;
                idx = i;
            }
        }
    }
    
    //cout << backward << endl;
    
    answer += min(forward,backward);
    return answer;
}