#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> PII;

void solve()
{
    string s; cin >> s;
    s = "#" + s;
    vector<int> pre(s.size());
    for(int i = 1; i < s.size(); i++)
    {
        if(s[i] == 'p') pre[i] = 1;
        pre[i] += pre[i - 1];
    }
    auto find = [&](int x) -> PII
    {
        int l = 1, r = x - 1;
        while(l < r)
        {
            int mid = l + r >> 1;
            if(pre[x - 1] - pre[mid - 1] == 0) r = mid;
            else l = mid + 1;
        }
        int first = l;
        l = x + 1, r = s.size() - 1;
        while(l < r)
        {
            int mid = l + r + 1 >> 1;
            if(pre[mid] - pre[x] == 0) l = mid;
            else r = mid - 1;
        }
        return {first, r};
    };
    int res = 0;
    for(int i = 1; i < s.size(); i++)
    {
        if(s[i] == 'c') continue;
        auto t = find(i);
        if(i == 15)
            cout << "";
        if(pre[i - 1] - pre[t.first - 1]) continue;
        if(pre[t.second] - pre[i]) continue;
        int len = min((i - t.first) / 2, t.second - i);
        // if(len != 0) cout << i << " " << len << "\n";
        res += len;
    }
    cout << res << '\n';
}

signed main()
{
	ios::sync_with_stdio(false);
    cin.tie(0);
	int t = 1; 
	cin >> t;
	while(t--)
	{
		solve();
	}
}