#include <stdio.h>
#include <algorithm>
#include <deque>
using namespace std;
using ll = long long;

//24
int main() {
	char r[4];
	int n, a, b, c, d, mask, flag = 0x3ff;
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		scanf("%d %d %d %d %s", &a, &b, &c, &d, r);
		mask = (1 << a) | (1 << b) | (1 << c) | (1 << d);
		if (r[0] == 'Y')
			flag &= mask;
		else
			flag ^= flag & mask;
	}
	flag--;
	flag = (flag & 0x155) + ((flag >> 1) & 0x155);
	flag = (flag & 0x333) + ((flag >> 2) & 0x333);
	flag = (flag & 0xf0f) + ((flag >> 4) & 0xf0f);
	flag = (flag & 0x0ff) + ((flag >> 8) & 0x0ff);
	printf("%d\n", flag);
}