#include <bits/stdc++.h>
using namespace std;
int gcd(long long a, long long b) {
  if (b == 0) {
    return a;
  } else {
    return gcd(b, a % b);
  }
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  ;
  long long i, j, k, n, m, t = 1;
  cin >> t;
  while (t--) {
    string s;
    cin >> s;
    n = s.size();
    map<char, long long> make_pair;
    long long mx = INT_MIN;
    for (i = 0; i < n; i++) {
      make_pair[s[i]]++;
    }
    for (char c = '0'; c <= '9'; c++) {
      if (make_pair[c] > mx) {
        mx = make_pair[c];
      }
    }
    for (char c1 = '0'; c1 < '9'; c1++) {
      for (char c2 = c1 + 1; c2 <= '9'; c2++) {
        k = 0;
        char prev = '$';
        for (i = 0; i < n; i++) {
          if (s[i] == c1) {
            if (prev == c2) {
              prev = c1;
              k++;
            } else if (prev == '$') {
              prev = c1;
              k++;
            }
          } else if (s[i] == c2) {
            if (prev == c1) {
              prev = c2;
              k++;
            } else if (prev == '$') {
              prev = c2;
              k++;
            }
          }
        }
        if (k > mx && k % 2 == 0) {
          mx = k;
        } else if ((k - 1) > mx && (k - 1) % 2 == 0) {
          mx = k - 1;
        }
      }
    }
    cout << s.size() - mx << endl;
  }
  return 0;
}
