The Love-Letter Mystery

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


int main() {
     
    int T;
    cin >> T;
    for(int i = 0;i < T;i++)
    {
        string s;
        cin >> s;
        int reduce = 0;
        int j = 0;
        int k = s.length()-1;
        while(j < k)
        {
            if(s[j] != s[k])
            {
                if(s[j] < s[k])
                {
                    while(s[k] != s[j])
                    {
                        s[k] = s[k] -1;
                        reduce++;
                    }
                }
                else if(s[k] < s[j])
                {
                    while(s[j] != s[k])
                    {
                        s[j] = s[j] -1;
                        reduce++;
                    }
                }
            }
            j++;
            k--;
        }
        cout << reduce <<endl;
    }
    return 0;
}