#include <bits/stdc++.h>
using namespace std;

template <class T> int sz(T&& a) { return int(size(forward<T>(a))); }

template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;

using ll = int64_t;
using vi = vc<int>;
using pii = pair<int, int>;
using uint = uint32_t;
using ull = uint64_t;

mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());

template <class F>
struct ycr {
	F f;
	template <class T> explicit ycr(T&& f_) : f(forward<T>(f_)) {}

	template <class... Args> decltype(auto) operator()(Args&&... args) {
		return f(ref(*this), forward<Args>(args)...);
	}
};
template <class F> decltype(auto) yc(F&& f) {
	return ycr<decay_t<F>>(forward<F>(f));
}

const int N=1e5+5;
char c[N];
int n;
int a[N];

int main() {
	//ios_base::sync_with_stdio(false), cin.tie(nullptr);
	//cout << fixed << setprecision(20);
	int T;
	cin>>T;
	while(T--)
	{
		scanf("%s",c+1);
		n=strlen(c+1);
		for(int i=2;i<=n;i++)
		{
			if(c[i]==c[i-1]) a[i]=1;
			else a[i]=0;
		}
		long long ans=0;
		for(int i=2;i<=n;i++)
		{
			if(a[i]==1)
			{
				ans+=1LL*(i-2+1)*(n-i+1);
			}
		}
		for(int i=1;i<=n;i++)
		{
			if(c[i]=='0') ans+=1LL*(n-i+1);
		}
		for(int i=1;i<=n;i++)
		{
			ans+=1LL*i*(n-i+1);
		}
		cout<<ans<<"\n";
	}
}