#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve();
int main(){
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);
    int T;cin>>T;
    while(T--)solve();
}
void solve(){
    string s;cin>>s;
    int n=s.size();
    vector<int>pos;
    pos.push_back(0);
    for(int i=0;i<n;i++)if(s[i]=='p')pos.push_back(i+1);
    pos.push_back(n+1);
    ll ans=0;
    for(int i=1;i<=n;i++)if(s[i-1]!='c'){
        int r=*upper_bound(pos.begin(),pos.end(),i);
        int l=*(--lower_bound(pos.begin(),pos.end(),i));
        //r-i-1
        //i-l-1
        ans+=min(r-i-1,(i-l-1)/2);
    }
    cout<<ans<<'\n';
}