#include <bits/stdc++.h>
using namespace std;
double EPS = 1e-9;
long long INF = 1000000000000000005ll;
double PI = acos(-1);
inline string IntToString(long long int a) {
  char x[100];
  sprintf(x, "%lld", a);
  string s = x;
  return s;
}
inline long long int StringToInt(string a) {
  char x[100];
  long long int res;
  strcpy(x, a.c_str());
  sscanf(x, "%lld", &res);
  return res;
}
inline string uppercase(string s) {
  int n = (int)s.size();
  for (long long int i = 0; i < n; i++)
    if (s[i] >= 'a' && s[i] <= 'z') s[i] = s[i] - 'a' + 'A';
  return s;
}
inline string lowercase(string s) {
  int n = (int)s.size();
  for (long long int i = 0; i < n; i++)
    if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';
  return s;
}
bool cmp(pair<long long int, long long int> a,
         pair<long long int, long long int> b) {
  long long int as = abs(a.first - a.second);
  long long int binary_search = abs(b.first - b.second);
  return (as > binary_search);
}
long long int dx[] = {-1, 0, 1, 0};
long long int dy[] = {0, 1, 0, -1};
vector<long long int> v[100005];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int t;
  cin >> t;
  while (t--) {
    string s;
    cin >> s;
    long long int n = s.length();
    long long int a[10] = {0};
    for (long long int i = 0; i < n; i++) {
      a[s[i] - '0']++;
    }
    long long int ma = INT_MIN;
    for (long long int i = 0; i < 10; i++) {
      ma = max(ma, a[i]);
    }
    for (long long int i = 0; i < 10; i++) {
      for (long long int j = 0; j < 10; j++) {
        if (j != i) {
          long long int cnt = 0;
          bool x = 0;
          for (long long int k = 0; k < n; k++) {
            if (!x) {
              if (s[k] - '0' == i) {
                x = 1;
                cnt++;
              }
            } else {
              if (s[k] - '0' == j) {
                cnt++;
                x = 0;
              }
            }
          }
          if (cnt % 2 == 0)
            ma = max(ma, cnt);
          else
            ma = max(ma, cnt - 1);
        }
      }
    }
    cout << n - ma << '\n';
  }
  return 0;
}
