#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




string a;

int consistency1(int n){

    int ones = 0;
    for(int i=0; i<n; i++) if(a[i] == '1') ones++;
    int zeroes = n-ones;
    
    if(ones == zeroes) return n;
    
    unordered_map<int, int> first = {{0, -1}};
    unordered_map<int, int> second;
    
    int sum = 0;
    int maxLen = 0;
    
    for(int i=0; i<n; i++){
        if(a[i] == '0') sum--;
        else sum++;
        
        //* Equal 0's and 1's 
        if(first.count(sum)){
            int j = first[sum];
            maxLen = max(maxLen, i-j);
        }
        
        
        //* 2 extra 1's in subarray
        if(first.count(sum-2)){
            int j = first[sum-2];
            int zr = (i-j)/2-1;
            if(zeroes - zr >= 1)	maxLen = max(maxLen, i-j);
        }
        if(second.count(sum-2)){
            int j = second[sum-2];
            int zr = (i-j)/2-1;
            if(zeroes - zr >= 1)	maxLen = max(maxLen, i-j);
        }
        
        
        //* 2 extra 0's in subarray
        if(first.count(sum+2)){
            int j = first[sum+2];
            
            int ons = (i-j)/2-1;
            if(ones - ons >= 1)		maxLen = max(maxLen, i-j);
        }
        if(second.count(sum+2)){
            int j = second[sum+2];
            
            int ons = (i-j)/2-1;
            if(ones - ons >= 1)		maxLen = max(maxLen, i-j);
        }
        
        
        if(!first.count(sum)){
            first[sum] = i;
        }
        else if(!second.count(sum)){
            second[sum] = i;
        }
    }
    return maxLen;

}









int maxEqualSubarray(string a, int n){

    int ones = 0;
    for(int i=0; i<n; i++) if(a[i] == '1') ones++;
    int zeroes = n-ones;
    
    if(ones == zeroes) return n;
    
    unordered_map<int, int> mp = {{0, -1}};
    
    int sum = 0;
    int maxLen = 0;
    
    for(int i=0; i<n; i++){
        if(a[i] == '0') sum--;
        else sum++;
        
        //* Equal 0's and 1's 
        if(mp.count(sum)){
            int j = mp[sum];
            maxLen = max(maxLen, i-j);
        }
        
        
        //* 2 extra 1's in subarray
        if(mp.count(sum-2)){
            int j = mp[sum-2];
            int zr = (i-j)/2-1;
            if(zeroes - zr >= 1)	maxLen = max(maxLen, i-j);
        }
        
        //* 2 extra 0's in subarray
        if(mp.count(sum+2)){
            int j = mp[sum+2];
            
            int ons = (i-j)/2-1;
            if(ones - ons >= 1)		maxLen = max(maxLen, i-j);
        }
        
        if(!mp.count(sum)){
            mp[sum] = i;
        }
    }
    return maxLen;

}


int consistency2(int n){
	string b(a);
	reverse(begin(b), end(b));
	
	return max(maxEqualSubarray(a, n) , maxEqualSubarray(b, n));
}





















int practice(int n){


    return 0;
}





void solve() {
    
    int n;

	cin >> a;
	n = a.size();
    
    cout << consistency1(n) <<  " " << consistency2(n) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}