#include <bits/stdc++.h>
using namespace std;
int main() {
  long long test;
  cin >> test;
  while (test--) {
    string s;
    cin >> s;
    vector<long long> count(10, 0);
    for (long long i = 0; i < s.size(); i++) {
      count[s[i] - '0']++;
    }
    long long max = 0;
    for (long long i = 0; i <= 9; i++) {
      if (count[i] > max) max = count[i];
    }
    long long max_size = 0;
    for (long long i = 0; i <= 9; i++) {
      for (long long j = 0; j <= 9; j++) {
        stack<long long> st;
        st.push(-1);
        long long siz = 0;
        if (i == j)
          continue;
        else {
          for (long long k = 0; k < s.size(); k++) {
            if (s[k] - '0' == i) {
              if (st.top() == -1) st.push(i);
            } else if (s[k] - '0' == j) {
              if (st.top() == i) {
                st.pop();
                siz = siz + 2;
              }
            }
          }
        }
        if (siz > max_size) max_size = siz;
      }
    }
    long long res = max > max_size ? max : max_size;
    cout << s.size() - res << '\n';
  }
  return 0;
}

### Prompt

Your task is to create a CPP solution to the following problem:

Let's call left cyclic shift of some string t_1 t_2 t_3 ... t_{n - 1} t_n as string t_2 t_3 ... t_{n - 1} t_n t_1.

Analogically, let's call right cyclic shift of string t as string t_n t_1 t_2 t_3 ... t_{n - 1}.

Let's say string t is good if its left cyclic shift is equal to its right cyclic shift.

You are given string s which consists of digits 0–9.

What is the minimum number of characters you need to erase from s to make it good?

Input

The first line contains single integer t (1 ≤ t ≤ 1000) — the number of test cases.

Next t lines contains test cases — one per line. The first and only line of each test case contains string s (2 ≤ |s| ≤ 2 ⋅ 10^5). Each character s_i is digit 0–9.

It's guaranteed that the total length of strings doesn't exceed 2 ⋅ 10^5.

Output

For each test case, print the minimum number of characters you need to erase from s to make it good.

Example

Input


3
95831
100120013
252525252525


Output


3
5
0

Note

In the first test case, you can erase any 3 characters, for example, the 1-st, the 3-rd, and the 4-th. You'll get string 51 and it is good.

In the second test case, we can erase all characters except 0: the remaining string is 0000 and it's good.

In the third test case, the given string s is already good.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
  long long test;
  cin >> test;
  while (test--) {
    string s;
    cin >> s;
    vector<long long> count(10, 0);
    for (long long i = 0; i < s.size(); i++) {
      count[s[i] - '0']++;
    }
    long long max = 0;
    for (long long i = 0; i <= 9; i++) {
      if (count[i] > max) max = count[i];
    }
    long long max_size = 0;
    for (long long i = 0; i <= 9; i++) {
      for (long long j = 0; j <= 9; j++) {
        stack<long long> st;
        st.push(-1);
        long long siz = 0;
        if (i == j)
          continue;
        else {
          for (long long k = 0; k < s.size(); k++) {
            if (s[k] - '0' == i) {
              if (st.top() == -1) st.push(i);
            } else if (s[k] - '0' == j) {
              if (st.top() == i) {
                st.pop();
                siz = siz + 2;
              }
            }
          }
        }
        if (siz > max_size) max_size = siz;
      }
    }
    long long res = max > max_size ? max : max_size;
    cout << s.size() - res << '\n';
  }
  return 0;
}

```