#include <cstdio>
#include <cstring>

#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <algorithm>

char strs[64][16];

char s1[12][16] = {"ne","ushi","tora","u","tatsu","mi","uma","hitsuji","saru","tori","inu","i"};
int count[12] = {};

int main() {

  // step 1
  int n;
  scanf("%d", &n);
  for(int i = 0; i < n; ++i) {
    scanf("%s", strs[i]);
    for(int j = 0; j < 12; ++j) {
      if( strcmp(strs[i], s1[j]) == 0 ) {
        count[j] += 1;
        break;
      }
    }
  }

  // step 2
  int max = 0;
  for(int i = 0; i < 12; ++i) {
    max = std::max(max, count[i]);
  }
  
  // step 3
  printf("%s\n", (max <= (n + 1) / 2 ? "YES" : "NO")); 

  return 0;
}