#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double EPS=1e-10;
const int inf=1e9;
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
int main(){
	int n;
	cin>>n;
	map<string,int>m;
	rep(i,n){
		string s;
		cin>>s;
		m[s]++;
	}
	int ma=-1;
	for(map<string,int>::iterator it=m.begin();it!=m.end();it++)ma=max(ma,it->second);
	if((n%2&&(n+1)/2<ma)||(n%2==0&&n/2<ma))cout<<"NO"<<endl;
	else cout<<"YES"<<endl;
}