/**
 Author : Kamonasish Roy (Bullet)
 Time : 2025-02-25 13:03:09
 **/

#include<bits/stdc++.h>
using namespace std;
const long long M=5e5,MOD=1e9+7;
typedef long long ll;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t=1;
    cin>>t;
    assert(t>=1 && t<=20);
    while(t--){
    	string s;
    	cin>>s;
    	int n=(int)s.size();
    	assert(n>=1 && n<=100000);
    	for(int i=0;i<n;i++){
    		assert(s[i]>='A' && s[i]<='Z');
    	}
    	int mx=n;
    	vector<int>fre(26,0);
    	vector<int>target(26,0);
    	string p="IEEELUSBCHAPTER";
    	for(char ch:p)target[ch-'A']++;
    	for(char ch:s)fre[ch-'A']++;
    	int x=1;
    	for(int i=0;i<26;i++)x &=(fre[i]>=target[i]);
    	if(!x){
    		cout<<-1<<"\n";
    		continue;
    	}
    	vector<int>tracking(26,0);
    	int start=0;
    	int f=0;
    	for(int i=0;i<n;i++){
    		tracking[s[i]-'A']++;
    		int ff=1;
    		for(int c=0;c<26;c++){
    			ff &= (tracking[c]>=target[c]);
    		}
    		f|=ff;
    		if(f){
    			while(start<i && tracking[s[start]-'A']-1>=target[s[start]-'A']){
    				tracking[s[start]-'A']--;
    				start++;
    			}
    			mx=min(mx,i-start+1);
    		}
    		
    	}
    	cout<<mx<<"\n";
    	
    	
    	
    	}
    	
    	   
    return 0;
 
}