#include <bits/stdc++.h>
using namespace std;
using cd = complex<double>;
const double pi = acos(-1);
vector<long long> ft(1, 1LL);
void solve() {
  string s;
  long long n, ret;
  cin >> s;
  n = s.size();
  ret = s.size() - 2;
  for (long long j = 0; j < 10; j++) {
    long long cunt = 0;
    for (auto i : s)
      if (i - '0' == j) cunt++;
    ret = min(ret, n - cunt);
  }
  long long f = 1, f2 = 1;
  for (long long i = 0; i < 10; i++) {
    for (long long j = 0; j < 10; j++) {
      long long cunt = 0;
      f = 1;
      if (i == j) continue;
      for (auto c : s) {
        if (f && c - '0' == i)
          cunt++, f = 1 - f;
        else if (!f && c - '0' == j)
          cunt++, f = 1 - f;
      }
      if (cunt % 2 != 0) cunt = 0;
      ret = min(ret, n - cunt);
    }
  }
  for (long long i = 0; i < s.size(); i++)
    if (s[i] != s[(i + 2) % n]) f2 = 0;
  if (f2) ret = 0;
  cout << ret << '\n';
}
signed main() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  cin.exceptions(cin.failbit);
  long long t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
}
