#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>

using namespace std;


void solve(){
	string s;
	cin >> s;
	
	int nums[27] = {0};
	
	for (int i = 0; i < s.size(); i ++){
		nums[s[i] - 'a'] ++;
	
	}
	
	int maxn = 0;
	for (int i = 0; i <= 25; i ++){
		maxn = max(maxn, nums[i]);
	}
	
	cout << s.size() - maxn << endl;
	
	
	
	
	
}


int main(){
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	int t = 1;
	cin >> t;
	while (t --) solve();
	
	
}