#include<bits/stdc++.h>
using namespace std;
mt19937 fxk(time(0));
#define mid ((l+r)>>1)
inline int qread()
{
	int a=0,f=1;char ch=getchar();
	while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
	while(isdigit(ch)){(a*=10)+=(ch^48);ch=getchar();}
	return a*f;
} 
int T,n,pre[1000010];
long long ans;
char ch[1000010];
inline void solve()
{
	scanf("%s",ch+1);n=strlen(ch+1);ans=0;
	for(int i=1;i<=n;++i)pre[i]=pre[i-1]+(ch[i]=='p');
	for(int i=1,L,R,l,r;i<=n;++i)if(ch[i]!='c')
	{
		l=i+1,r=n,R=i;
		while(l<=r)
		{
			if(pre[mid]-pre[i]==0)R=mid,l=mid+1;
			else r=mid-1;
		}
		l=1,r=i-1,L=i;
		while(l<=r)
		{
			if(pre[r]-pre[mid-1]==0)L=mid,r=mid-1;
			else l=mid+1;
		}
		ans+=min((R-i),(i-L)>>1);
		// printf("[%d %d %d]\n",L,i,R);
	}
	printf("%lld\n",ans);
	return ;
}
int main()
{
	T=qread();
	while(T--)solve();
	return 0;	
}