#include <cstdio>
#include <cstring>
#include <algorithm>

const int N = 1000005;

char ch[N];
int bef[N], aft[N];

int main() {
  int T;
  scanf("%d", &T);
  while (T--) {
    scanf("%s", ch + 1);
    int n = strlen(ch + 1);
    bef[0] = 0;
    for (int i = 1; i <= n; ++i) {
      if (ch[i] == 'p') bef[i] = 0;
      else bef[i] = bef[i - 1] + 1;
    }
    aft[n + 1] = 0;
    for (int i = n; i >= 1; --i) {
      if (ch[i] == 'p') aft[i] = 0;
      else aft[i] = aft[i + 1] + 1;
    }
    long long ans = 0;
    for (int i = 1; i <= n; ++i) {
      if (ch[i] == 'p' || ch[i] == '?') {
        ans += std::min(bef[i - 1] / 2, aft[i + 1]);
      }
    }
    printf("%lld\n", ans);
  }
  return 0;
}