#include <bits/stdc++.h>
#include "hiccup.h"
//~ #include "grader.cpp"
using namespace std;
const int N = 1000001;
int n;
string s;
vector <int> h;
bool valid(){
int o = 0;
for(auto &i : s){
o += i == 'H';
o -= i == 'C';
if(o < 0) return 0;
}
if(o) return 0;
for(auto &i : s){
if(i == 'H') o = 0;
else if(i == 'C') o = 1;
else if(o == 0) return 0;
}
return 1;
}
int HicCup(std::string S) {
s = S;
n = s.size();
if(!valid() || s == string(n, '!')) return -1;
h.resize(n);
assert(s[0] == 'H');
h[0] = 1;
for(int i = 1 ; i < n ; i++){
h[i] = h[i - 1];
if(s[i] == 'H') h[i]++;
else if(s[i] == 'C') h[i]--;
}
vector <int> exs(n), cs(n);
int ans = n;
for(int i = n - 1 ; i >= 0 ; i--){
if(s[i] == '!') exs[h[i]]++;
else if(s[i] == 'C'){
cs[h[i]]++;
ans = min(ans, exs[h[i]] / cs[h[i]]);
}
}
return ans;
}
