#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=1e5+5,M=N*20+5,K=600+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=1e18+7;mt19937 rnd(time(0));
int n,m,k;char s[N];
void init(){
	int i,j;
}
void Solve(){
	int i,j;scanf("%s",s+1);n=strlen(s+1);
	ll ans=0;
	for(i=1;i<=n;i++) ans+=1ll*i*(n-i+1);
	for(i=1;i<=n;i++) if(s[i]=='0') ans+=n-i+1;
	for(i=1;i<n;i++) if(s[i]==s[i+1]) ans+=1ll*i*(n-i);
	printf("%lld\n",ans);
}
int main(){
	int t;init();
	scanf("%d",&t);
	// t=1;
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}