#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <random>

#define REP(i,n) for(long (i)=0;(i)<(n);(i)++)
#define FOR(i,a,b) for(long (i)=(a);(i)<(b);(i)++)
#define RREP(i,a) for(long (i)=(a)-1;(i)>=0;(i)--)
#define FORR(i,a,b) for(long (i)=(a)-1;(i)>=(b);(i)--)
#define MOD 1000000007
#define PI acos(-1.0)
#define DEBUG(C) cout<<C<<endl;
#define PII pair<int,int>
#define PLL pair<long,long>
#define ALL(a) (a).begin(),(a).end()
#define SORT(a) sort((a).begin(),(a).end())
#define RSORT(a) sort((a).begin(),(a).end(),greater<int>())

typedef long long LL;
typedef unsigned long long ULL;

using namespace std;

vector<string> a{"ne","ushi","tora","u","tatsu","mi","uma","hitsuji","saru","tori","inu","i"};
int main(void){
    map<string,int> mp;
    REP(i,a.size()) mp[a[i]]=0;
    int N; cin>>N;
    string s;
    REP(i,N){
        cin>>s; mp[s]++;
    }
    vector<int> v;
    for(auto itr=mp.begin();itr!=mp.end();itr++){
        v.emplace_back(itr->second);
    }
    RSORT(v);
    string ans="NO";;
    if(N%2==0 && v[0]<=N/2){
        ans="YES";
    }else if(N%2 && v[0]<=(N/2)+1){
        ans="YES";
    }
    cout<<ans<<endl;
}