// macros
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <map>

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;

#define LLINF 1000000000000000000LL
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define debug(a) cout << "L(" << __LINE__ << "):" << #a << ":" << a << endl;

// problems limits
#define MAX_N 100

// Variables
int N;
vector<string> eto;

// problems input
void input()
{
    cin >> N;
    FOR(i,0,N) {
        string s;
        cin >> s;
        eto.push_back(s);
    }
}

// problems main

void solve()
{
   map<string, int> ecnt;
   FOR(i,0,N) {
       ecnt[eto[i]]++;
   }
   vector<int> v;
   for(map<string,int>::iterator ite=ecnt.begin(); ite!=ecnt.end();ite++) {
       v.push_back(ite->second);
   }
   sort(v.begin(),v.end(), greater<int>());
   if (v.size() == 1 || v[0]-2>=v[1]) {
       cout << "NO" << endl;
   } else {
       cout << "YES" << endl;
   }
}

int main()
{
    ios::sync_with_stdio(false);

    input();

    solve();
}