#include<iostream>
#include<string>
#include<algorithm>
#include<functional>
#include<vector>
#include<set>
#include<queue>
#include<list>
#include<stdio.h>
#include<stdlib.h>
#include<map>

#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()

typedef long long ll;

using namespace std;

int main() {

	int n;
	cin >> n;

	

	map<string, int> a;

	for (int i = 0; i < n; i++) {
		string buf;
		cin >> buf;

		++a[buf];
	}

	vector<int> b;
	fore(i, a) {
		b.push_back(i.second);
	}

	sort ( b.begin(), b.end(), greater<int>());

	int max = b.front();

	int limit = (n + 2 - 1) / 2;

	if (max > limit) {
		cout << "NO" << endl;
	}
	else {
		cout << "YES" << endl;
	}
}