#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define int long long
#define all(x) (x).begin(), (x).end()
#define f(i, n) for (int i = 0; i < n; i++)
#define trace(x) cerr << #x << ": " << x << '\n'

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t;
    cin >> t;
    string m = "SERIOUSOJ";
    while (t--)
    {
        string s;
        cin >> s;
        int n = s.size();

        map<char, int> mp;
        for (int i = 0; i < n; i++)
        {
            mp[s[i]]++;
        }

        int ans = 0;
        for (char x : m)
        {
            if (mp[x] > 0)
            {
                mp[x]--;
            }
            else
            {
                int min_cost = LLONG_MAX;
                char best_char = 0;
                for (int i = 1; i <= 13; i++)
                {
                    char forward_char = (x - 'A' + i) % 26 + 'A';
                    if (mp[forward_char] > 0)
                    {
                        min_cost = min(min_cost, i);
                        best_char = forward_char;
                    }
                    char backward_char = (x - 'A' - i + 26) % 26 + 'A';
                    if (mp[backward_char] > 0)
                    {
                        min_cost = min(min_cost, i);
                        best_char = backward_char;
                    }
                }
                if (best_char != 0)
                {
                    mp[best_char]--;
                    ans += min_cost;
                }
            }
        }

        cout << ans << '\n';
    }
}