#include <bits/stdc++.h>
int main() {
    int T;
    std::cin >> T;
    while (T--) {
        std::string s;
        std::cin >> s;
        int cnt = 0, n = s.size();
        for (int i = 0; i < n; ++i) cnt += s[i] == '1';
        if (cnt < n - cnt) {
            for (int i = 0; i < n; ++i) s[i] = s[i] ^ 1;
            std::reverse(s.begin(), s.end());
        }
        std::vector <int> preSum(n);
        for (int i = 0; i < n; ++i)
            preSum[i] = (s[i] == '1'? 1: -1) + (i > 0? preSum[i - 1]: 0);
        std::rotate(s.begin(), s.begin() + (std::min_element(preSum.begin(), preSum.end()) - preSum.begin()) + 1, s.end());
        int sum = 0, pos = 0;
        std::vector <int> one;
        int ans = 0;
        for (int i = 0; i < n - 1; ++i) {
            if (s[i] == '1' && s[i + 1] == '1') one.push_back(i);
            if (s[i] == '0' && s[i + 1] == '0') {
                ans = std::max(ans, (i - one.back()) / 2);
                one.pop_back();
            }
        }
        std::fill(s.begin(), s.end(), 0);
        for (int p: one) s[p - one[0]] = s[p - one[0] + 1] = '1';
        for (int i = 0; i < n; ++i) if (!s[i]) s[i] = s[i - 1] ^ 1;
        std::vector <int> kmp(n);
        for (int i = 1, k = 0; i < n; ++i) {
            while (k > 0 && s[i] != s[k]) k = kmp[k - 1];
            kmp[i] = s[i] == s[k]? ++k: 0;
        }
        if (n % (n - kmp[n - 1]) == 0) ans += (n - kmp[n - 1]);
        else ans += n;
        printf("%d\n", ans);
    }
}