#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
#include <iomanip>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }

int main()
{
	int n;
	cin >> n;

	while(n--)
	{
		int out = 0;
		vint v(4, 0);

		while(out != 3)
		{
			string ev;
			cin >> ev;

			if(ev == "OUT") out++;
			else if(ev == "HIT")
			{
				rep(i, 3)
				{
					v[3 - i] += v[2 - i];
					v[2 - i] = i == 2;
				}
			}
			else
			{
				v[3] += accumulate(v.begin(), v.begin() + 3, 1);
				fill(v.begin(), v.begin() + 3, 0);
			}
		}

		cout << v[3] << endl;
	}
}