#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
long long mod = 998244353;
vector<long long> fact;
bool remender(long long a, long long b) { return a % b; }
long long add(long long x, long long y) { return (x + y) % mod; }
long long multi(long long x, long long y) { return (x * y) % mod; }
void fac(int n) {
  fact.push_back(1);
  for (long long i = 1; i <= n; i++) {
    fact.push_back(multi(i, fact.back()));
  }
}
long long power(long long x, long long y) {
  x %= mod;
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = multi(res, x);
    y = y >> 1;
    x = multi(x, x);
  }
  return res;
}
long long inverse(long long n) { return power(n, mod - 2); }
long long nCr(int n, int r) {
  if (n < r) return 0;
  if (r == 0) return 1;
  return (multi(fact[n], multi(inverse(fact[r]), inverse(fact[n - r])))) % mod;
}
void solve() {
  string s;
  cin >> s;
  int n = s.size();
  int ans = 0;
  int arr[10];
  memset(arr, 0, sizeof arr);
  for (int i = 0; i < n; i++) arr[s[i] - '0']++;
  for (int i = 0; i < 10; i++) {
    ans = max(ans, arr[i]);
  }
  for (int i = 0; i < 10; i++) {
    for (int j = 0; j < 10; j++) {
      if (i == j) continue;
      int cnt = 0, l = i;
      for (int m = 0; m < n; m++) {
        if (s[m] - '0' == l) {
          cnt++;
          if (l == i)
            l = j;
          else
            l = i;
        }
      }
      if (cnt & 1) cnt--;
      ans = max(ans, cnt);
    }
  }
  cout << n - ans << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
