/* -*- coding: utf-8 -*-
 *
 * 349.cc: No.349 干支の置き物 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 50;

const string ETOS[12] = {
  "ne", "ushi", "tora", "u", "tatsu", "mi",
  "uma", "hitsuji", "saru", "tori", "inu", "i"
};

/* typedef */

/* global variables */

int cnts[MAX_N];

/* subroutines */

/* main */

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

  for (int i = 0; i < n; i++) {
    string s;
    cin >> s;
    int k = find(ETOS, ETOS + 12, s) - ETOS;
    cnts[k]++;
  }

  int maxc = 0;
  for (int i = 0; i < 12; i++)
    if (maxc < cnts[i]) maxc = cnts[i];

  cout << ((maxc <= (n + 1) / 2) ? "YES" : "NO") << endl;
  return 0;
}