#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>
using namespace std;
#define lint long long int
/*
vector<char>al(26);
al = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
vector<char>AL(26);
AL = {'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
*/

int main() {
	int N;
	cin >> N;
	vector<string>veca(N);
	for (int ia = 0; ia < N; ia++) {
		cin >> veca.at(ia);
	}
	vector<int>vecb(12);
	for (int ib = 0; ib < N; ib++) {
		if (veca.at(ib) == "ne") vecb.at(0)++;
		if (veca.at(ib) == "usi") vecb.at(1)++;
		if (veca.at(ib) == "tora") vecb.at(2)++;
		if (veca.at(ib) == "u") vecb.at(3)++;
		if (veca.at(ib) == "tatsu") vecb.at(4)++;
		if (veca.at(ib) == "mi") vecb.at(5)++;
		if (veca.at(ib) == "uma") vecb.at(6)++;
		if (veca.at(ib) == "hitsuji") vecb.at(7)++;
		if (veca.at(ib) == "saru") vecb.at(8)++;
		if (veca.at(ib) == "tori") vecb.at(9)++;
		if (veca.at(ib) == "inu") vecb.at(10)++;
		if (veca.at(ib) == "i") vecb.at(11)++;
	}
	int cnt = 0;
	if (N % 2 == 0) {
		for (int ic = 0; ic < 12; ic++) {
			if (vecb.at(ic) > N / 2) {
				cout << "NO" << endl;
				cnt++;
				break;
			}
		}
		if (cnt == 0) cout << "YES" << endl;
	}
	else {
		for (int id = 0; id < 12; id++) {
			if (vecb.at(id) > N / 2 + 1) {
				cout << "NO" << endl;
				cnt++;
				break;
			}
		}
		if (cnt == 0) cout << "YES" << endl;
	}
}