#include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
using namespace std;
const int N = 2e6;
char s[N];
int n;
map <char,int> mp;
void solve() {
  cin >> (s + 1);
  n = strlen(s + 1);
  int ans = n;
  mp.clear();
  for (int i = 1; i <= n; i++)  mp[s[i]] ++;
  for (int i = 1; i <= n; i++)  ans = min(ans, n - mp[s[i]]);
  cout << ans << "\n";
}
signed main () {
  ios :: sync_with_stdio(false);
  cin.tie(nullptr), cout.tie(nullptr);
  int T = 1;
  cin >> T;
  while (T--)  solve();
  return 0;
}