#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;

#define RREP(i,s,e) for (i = e-1; i >= s; i--)
#define rrep(i,n) RREP(i,0,n)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 1e8

typedef long long ll;

int main() {
    int i, n, mx;
    map<string,int> m;
    cin >> n;
    rep (i,n) {
        string s;
        cin >> s;
        m[s]++;
    }
    mx = 0;
    for (auto p : m)
        mx = max(mx,p.second);
    if (mx <= (n+1) / 2)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
    return 0;
}