#include <bits/stdc++.h>
using namespace std;
long long int po(long long int x, long long int n) {
  if (n == 0)
    return 1;
  else if (n % 2 == 0)
    return po((x * x) % 1000000007, n / 2);
  else
    return (x * po((x * x) % 1000000007, (n - 1) / 2)) % 1000000007;
}
long long int GCD(long long int A, long long int B) {
  if (B == 0)
    return A;
  else
    return GCD(B, A % B);
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long int t = 1;
  cin >> t;
  while (t--) {
    string s;
    cin >> s;
    long long int f[10] = {0};
    long long int n = s.length();
    long long int an = n - 1;
    for (int i = 0; i < n; ++i) f[s[i] - '0']++;
    for (int i = 0; i < 10; ++i) an = min(an, n - f[i]);
    for (int i = 0; i < 10; ++i) {
      for (int j = 0; j < 10; ++j) {
        if (i == j) continue;
        long long int d = 0;
        long long int ct = 0;
        for (int k = 0; k < n; ++k) {
          if (s[k] - '0' == i && d % 2 == 0) {
            ct++;
            d++;
          }
          if (s[k] - '0' == j && d % 2 == 1) {
            ct++;
            d++;
          }
        }
        ct -= ct % 2;
        an = min(an, n - ct);
      }
    }
    cout << an << "\n";
  }
}
