/*If we keep holding onto yesterday, what are we going to be tomorrow?*/


#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long int 
bool debugg = false;
#define dbg if(debugg)
#define F first 
#define S second 
template <typename T>
using order_set = tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());  

int f(string &s)
{
    int n = s.size() , mx = 0;
    map<char,int>cnt;
    for(int i = 0 ; i < n ; i ++){
        cnt[s[i]] ++;
        mx = max(mx , cnt[s[i]]);
    }

    return n - mx;
}

void solve()
{
    string s;
    cin >> s;

    int n = s.size();
    if(n % 2 == 0){
        cout << f(s) << '\n';
    }

    else{
        string a , b;
        for(int i = 0 ; i < n ; i ++){
            if(i % 2) a += s[i];
            else b += s[i];
        }

        cout << min(f(s) , f(a) + f(b)) << '\n';
    }
}



int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
        
    int t  = 1;
    cin >> t;
    
    while(t--){
        solve();
    }

    return 0;

}