#include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <array>
#include <queue>
#include <deque>
#include <set>
#include <list>
#include <map>
#include <stack>
#include <utility>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <climits>
#include <bitset>
#include <random>
#include <functional>
#include <sstream>
#include <iomanip>

using namespace std;

#define _CRT_SECURE_NO_WARNINGS
#define rep(i, n) for(int i=0; i<(n); i++)
#define FOR(i, m, n) for(int i=(m);i<(n);i++)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define SORT(x) sort((x).begin(),(x).end())
#define REVE(x) reverse((x).begin(),(x).end())
#define mp make_pair
#define pb push_back

typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<vector<int>> VVI;
typedef pair<int, int> PII;
typedef long long LL;

int main() {
	int n;
	cin >> n;
	VS a(n);
	rep(i, n)cin >> a[i];

	VI cnt(13);
	rep(i, n) {
		if (a[i] == "ne")cnt[0]++;
		if (a[i] == "ushi")cnt[1]++;
		if (a[i] == "tora")cnt[2]++;
		if (a[i] == "u")cnt[3]++;
		if (a[i] == "tatsu")cnt[4]++;
		if (a[i] == "mi")cnt[5]++;
		if (a[i] == "uma")cnt[6]++;
		if (a[i] == "hitsuji")cnt[7]++;
		if (a[i] == "saru")cnt[8]++;
		if (a[i] == "tori")cnt[9]++;
		if (a[i] == "inu")cnt[10]++;
		if (a[i] == "i")cnt[11]++;
	}
	int max = *max_element(all(cnt));
	puts(max > (n + 1) / 2 ? "NO" : "YES");
}