#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<sstream>
#include<iterator>
#include<list>

using namespace std;

typedef  long long int lint;

#define rep(i, n) for (lint i = 0; i < n; i++)
#define sort(v) sort((v).begin(), (v).end())
#define reverse(v) reverse((v).begin(), (v).end())
#define upper(v,hoge) upper_bound(v.begin(),v.end(),hoge)
#define lower(v,hoge) lower_bound(v.begin(),v.end(),hoge)
#define mp make_pair
#define enld endl

int main() {
	lint T;
	cin >> T;
	string S;
	lint out = 0;
	vector<lint>A;
	while (cin >> S) {
		if (S == "HIT") {
			rep(i, A.size()) {
				A[i] += 1;
			}
			A.push_back(1);
		}
		else if (S == "OUT") {
			out++;
			if (out == 3) {
				lint cnt = 0;
				rep(i, A.size()) {
					if (A[i] >= 4) {
						cnt++;
					}
				}
				cout << cnt << endl;
				A.clear();
				out = 0;
			}
		}
		else if (S == "HOMERUN") {
			rep(i, A.size()) {
				A[i] += 4;
			}
			A.push_back(4);
		}
	}
}
