#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>
#include<set>

#define rep(i,n) for(int (i) = 0; i < (n); i++)

using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;

const ll mod = 998244353;

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