#include <bits/stdc++.h>
#define endl '\n'
#define F first
#define S second
using namespace std;
#define ll long long
#define pb push_back
#define mod 1000000007
// #define int long long
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define CheckBit(x,k)   (x & (1LL << k))
#define SetBit(x,k)     (x |= (1LL << k))
#define ClearBit(x,k)   (x &= ~(1LL << k))
#define toggleBit(x,k)  (x ^= (1LL << k))
#define LSB(mask)       __builtin_ctzll(mask)
#define MSB(mask)       63-__builtin_clzll(mask) 
#define print(x)    cout << #x << " : " << x << endl
#define error1(x)   cerr << #x << " = " << (x) <<endl
#define coutall(v)  for(auto &it: v) cout<<it<<' '; cout<<endl
#define Abid_52     ios::sync_with_stdio(false);cin.tie(0),cin.tie(0)
#define error2(a,b) cerr<<"( "<<#a<<" , "<<#b<<" ) = ( "<<(a)<<" , "<<(b)<<" )\n"
#define UNIQUE(x)   sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()
template <typename T, typename U> T ceil(T x, U y) {return (x > 0 ? (x + y - 1) / y : x / y);}
template <typename T, typename U> T floor(T x, U y) {return (x > 0 ? x / y : (x - y + 1) / y);}

const int N = 2e5 + 10;

void solve()
{
    int n, m;
    string s, s1;
    cin >> s;
    n = s.length();
    s1 = "IEEELUSBCHAPTER";
    map<char, int>mp;
    for(int i = 0; i < s1.length(); i++)
    {
        mp[s1[i]]++;
    }
    vector<vector<int>> pre(26, vector<int>(n+1, 0));
    for (int i = 0; i < n; i++) {
        for (int c = 0; c < 26; c++) {
            pre[c][i+1] = pre[c][i];
        }
        int idx = s[i] - 'A';
        pre[idx][i+1]++;
    }
    auto check = [&](int len) {
        for (int i = 0; i + len - 1 < n; i++) {
            int l = i, r = i + len;
            bool valid = true;
            for (auto it : mp) {
                if (pre[it.first - 'A'][r] - pre[it.first - 'A'][l] < it.second) {
                    valid = false;
                    break;
                }
            }
            if (valid) {
                return true;
            }
        }
        return false;
    };
    
    int l = 1, r = n, ans = -1;
    while(l <= r)
    {
        int mid = (l + r) / 2;
        // print(mid);
        if(check(mid))
        {
            r = mid - 1;
            ans = mid;
        }
        else{
            l = mid + 1;
        }
    }
    cout << ans << endl;
}

int32_t main()
{
    Abid_52;
    int t = 1;
    cin >> t;
    for (int tc = 1; tc <= t; ++tc)
    {
        // cout << "Case " << tc << ": ";
        solve();
    }
}