#include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>

#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define repi(i,a,b) for(int i = (a); i < (b); i++)

using namespace std;

typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;

const int INF=1<<29;
const double EPS=1e-9;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
int main(){
	int n;
	cin>>n;
	string str;
	while(n--){
		int out = 3;
		int score = 0;
		int f,s,t;
		f=s=t=0;
		while(out){
			cin>>str;
			stringstream ss;
			ss <<str;
			string tmp;
			ss >>tmp;
			if(tmp=="HIT"){
				if(t){
					score++;
					t = 0;
				}
				if(s){
					s = 0;
					t = 1;
				}
				if(f){
					s = 1;
					f = 1;
				}else{
					f=1;
				}
			}else if(tmp=="HOMERUN"){
				//cout <<"tmp = "<<tmp<<endl;
				score+=(t+s+f+1);
				//cout <<score<<endl;
				t=s=f=0;
			}else{
				out--;
			}
		}
		cout <<score<<endl;
	}
	return 0;
}