#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
const long long N = 1000000007;
long long binpow(long long b, long long p) {
  long long ans = 1;
  while (p > 0) {
    if (p & 1) ans = (ans * b) % mod;
    b = (b * b) % mod;
    p >>= 1;
  }
  return ans;
}
long long inv(long long x) { return binpow(x, mod - 2); }
long long divide(long long x, long long y) {
  return ((x % mod) * (inv(y))) % mod;
}
long long solve(string& s, char c, char d) {
  int cur = 0;
  long long ans = 0;
  long long i;
  for (i = 0; i < s.size(); i++) {
    if (cur == 0) {
      if (s[i] != c)
        ans++;
      else
        cur ^= 1;
    } else {
      if (s[i] != d)
        ans++;
      else
        cur ^= 1;
    }
  }
  long long check = s.size() - ans;
  if (check % 2 != 0 && (c != d)) {
    return ans + 1;
  } else
    return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long tt, i, n;
  cin >> tt;
  while (tt--) {
    string s;
    cin >> s;
    long long ans, val1, val2;
    if (s.size() <= 2) {
      cout << 0 << endl;
      continue;
    } else
      ans = s.size() - 2;
    char c, d;
    for (c = '0'; c <= '9'; c++) {
      for (d = '0'; d <= '9'; d++) {
        val1 = solve(s, c, d);
        ans = min(val1, ans);
      }
    }
    cout << ans << endl;
  }
  return 0;
}
