#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;

#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)

int main() {
	int n,syu[12] = {},limit = 0;
	string str;
	string syurui[12] = {"ne","ushi","tora","u","tatsu","mi","uma","hitsuji","saru","tori","inu","i"};
	cin >> n;
	if(n % 2 == 0) limit = n / 2;
	else limit = n / 2 + 1;
	for(int i = 0;i < n;i++){
		cin >> str;
		for(int j = 0;j < 12;j++){
			if(str == syurui[j]) syu[j]++;
		}
	}
	bool ans = 0;
	for(int i = 0;i < 12;i++){
		if(syu[i] > limit) ans = 1;
	}
	if(ans) cout << "NO" << endl;
	else cout << "YES" << endl;
	return 0;
}