#include <bits/stdc++.h>
#define ll long long int
#define N "\n"
using namespace std;
ll shift(char a, char b)
{
      ll d = abs(a - b);
      return min(d, 26 - d);
}
int main()
{
      ios_base::sync_with_stdio(false);
      cin.tie(NULL);
      ll t;
      cin >> t;
      while (t--)
      {
            string s;
            cin >> s;
            string tar = "SERIOUSOJ";
            unordered_map<char, int> freq;
            vector<char> store;
            for (auto c : s)
            {
                  freq[c]++;
                  if (freq[c] <= tar.size())
                        store.push_back(c);
            }
            vector<vector<ll>> cost(tar.size(), vector<ll>((store.size())));
            for (ll i = 0; i < tar.size(); i++)
            {
                  for (ll j = 0; j < store.size(); j++)
                  {
                        cost[i][j] = shift(store[j], tar[i]);
                  }
            }

            vector<ll> dp(1ll << (store.size()), INT_MAX);
            dp[0] = 0;
            ll ans = INT_MAX;
            for (ll i = 0; i < 1ll << store.size(); i++)
            {
                  ll assign = __builtin_popcount(i);
                  if (assign < tar.size())
                  {
                        for (ll j = 0; j < store.size(); j++)
                        {
                              if (!(i & (1ll << j)))
                              {
                                    ll new_i = (1ll << j) | i;
                                    dp[new_i] = min(dp[new_i], dp[i] + cost[assign][j]);
                              }
                        }
                  }
            }
            for (ll i = 0; i < 1ll << store.size(); i++)
            {
                  if (__builtin_popcount(i) == tar.size())
                  {
                        ans = min(ans, dp[i]);
                  }
            }
            cout << ans << N;
      }
}