#include <iostream>
#include <string>
#include <climits>
#include <algorithm>
#include <cmath>

using namespace std;

void solve() {
    string s;
    cin >> s;
    int n = s.size();
    double min_cost = LONG_MAX;
    int min_len = 0;

    // Check all possible substrings
    for (int i = 0; i < n; ++i) {
        for (int j = i; j < n; ++j) {
            string current_str = s.substr(i, j - i + 1);
            long num = 0;
            int sum = 0;
            for (char c : current_str) {
                num = num * 10 + (c - '0');
                sum += (c - '0');
            }
            double cost = (double)num / sum;
            if (cost < min_cost) {
                min_cost = cost;
                min_len = current_str.size();
            } else if (cost == min_cost) {
                if (current_str.size() > min_len) {
                    min_len = current_str.size();
                }
            }
        }
    }
    cout << n - min_len << endl;
}

int main() {
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}