#include <bits/stdc++.h>
using namespace std;
void solve() {
  string s;
  cin >> s;
  int n = s.size();
  int ans = 0;
  vector<int32_t> abc(10);
  int mxabc = 0;
  vector<vector<int32_t>> b(10);
  for (int i = 0; i < n; ++i) {
    abc[s[i] - '0']++;
    b[s[i] - '0'].push_back(i);
    mxabc = max(mxabc, abc[s[i] - '0']);
  }
  for (int i = 0; i < 10; ++i) {
    for (int j = 0; j < 10; ++j) {
      if (i == j) continue;
      int cnt = 0;
      for (int ii = 0, jj = 0; ii < b[i].size() && jj < b[j].size();) {
        if (b[i][ii] < b[j][jj]) {
          while (ii < b[i].size() && b[i][ii] < b[j][jj]) ii++;
          cnt += 2;
        } else {
          jj++;
        }
      }
      ans = max(ans, cnt);
    }
  }
  cout << min(n - ans, n - mxabc) << '\n';
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t_;
  cin >> t_;
  while (t_--) solve();
  return 0;
}
