#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const ll mod = 1000000007;
const ll M = 1000000000000000000ll;
inline ll add(ll a, ll b) { return ((a % mod + b % mod) % mod); }
inline ll sub(ll a, ll b) { return ((a % mod - b % mod + mod) % mod); }
inline ll mult(ll a, ll b) { return (((a % mod) * (b % mod)) % mod); }
inline ll power(ll n, ll x) {
  ll p = 1;
  while (x != 0) {
    if (x % 2 == 0) {
      n = mult(n, n);
      x = x / 2;
    }
    p = mult(p, n);
    x--;
  }
  return p;
}
inline ll recurmult(ll a, ll b) {
  ll r = 0;
  while (b) {
    if (b & 1) r = add(r, a);
    a = mult(2, a);
    b >>= 1;
  }
  return r % mod;
}
ll findans(set<ll>& s1, set<ll>& s2) {
  ll ans = 1;
  if (s1.size() == 0 || s2.size() == 0) return ans;
  ll x1 = *s1.begin();
  ll x2 = *s2.begin();
  if (x1 < x2) {
    while (1) {
      auto it1 = s2.upper_bound(x1);
      if (it1 == s2.end()) break;
      ans++;
      auto it2 = s1.upper_bound(*it1);
      if (it2 == s1.end()) break;
      x1 = *it2;
      ans++;
    }
  } else {
    while (1) {
      auto it1 = s1.upper_bound(x1);
      if (it1 == s1.end()) break;
      ans++;
      auto it2 = s2.upper_bound(*it1);
      if (it2 == s2.end()) break;
      x1 = *it2;
      ans++;
    }
  }
  return (ans / 2) * 2;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  ll t;
  cin >> t;
  while (t--) {
    string s;
    cin >> s;
    set<ll> s1[10];
    for (ll i = 0; i < s.length(); i++) {
      s1[s[i] - '0'].insert(i);
    }
    ll ans = 0;
    for (ll i = 0; i < 10; i++) {
      for (ll j = 0; j < 10; j++) {
        if (i != j)
          ans = max(ans, findans(s1[i], s1[j]));
        else
          ans = max(ans, (ll)s1[i].size());
      }
    }
    cout << s.length() - ans << "\n";
  }
}
