#include <bits/stdc++.h>
#define int long long

using namespace std ;

const int N = 1e6 + 5 ;
int n , m , a[N] ;

void solve()
{
    string s ; 
    cin >> s ; 
    int n = s.length() ; 
    s = ' ' + s ; 
    vector f(2 , 0ll) , g = f ; 

    int res = 0 ; 
    for (int i = 1 ; i <= n ; ++ i) {
        ++ g[0] ; 
        if (s[i] == '1') {
            f[1] = (f[0] + f[1] + g[0] * 1 + g[1] * 2) ;  // 0 -> 1
            g[1] = (g[0] + g[1]) ; // 1 -> 1
            f[0] = g[0] = 0 ; 
        }
        else {
            f[0] = (f[0] + f[1] + g[0] * 2 + g[1] * 1) ;  // 0 -> 0
            g[0] = (g[0] + g[1]) ; // 1 -> 0
            f[1] = g[1] = 0 ; 
        }
        // cout << g[0] << ' ' << f[0] << '\n' ; 
        // cout << g[1] << ' ' << f[1] << '\n' ; 
        res += f[0] + f[1] ; 
    }
    cout << res << '\n' ; 
}
signed main()
{
    ios::sync_with_stdio(false) ; 
    cin.tie(0) , cout.tie(0) ; 

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