#include <bits/stdc++.h>

using namespace std;
using LL = long long;

const int N = 3e3 + 10 , Mod = 1e9 + 7;

LL f[N][N] , sum[N];

void solved(){
    string s;
    cin >> s;

    map<char , int> mp;
    for(char c : s)
        mp[c] ++;
    int ans = s.size();
    for(char c = 'a' ; c <= 'z' ; c ++ )
        ans = min(ans , int(s.size()) - mp[c]);
    cout << ans << "\n";
}

int main() {

//     freopen("D:\\dev\\code\\sunwking\\1.in" , "r" , stdin);

    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    cin >> t;

    while(t -- )
        solved();

    return 0;
}