#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <stack>
#include <queue>
#include <utility>
#define rep(i,l,n) for(int i=l;i<n;i++)
#define rer(i,l,n) for(int i=l;i<=n;i++)
#define rrep(i,n,l) for(int i=n-1;i>=l;i--)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define pb(a) push_back(a);
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef vector<int> vi;
typedef vector<lint> vli;
typedef vector<vi> vvi;
typedef pair<int,int> pii;

int main(){
	int n;
	map<string,int> m;
	cin>>n;
	rep(i,0,n){
		string s;
		cin>>s;
		m[s]++;
	}
	int MAX=0;
	//string str;
	for(map<string,int>::iterator it=m.begin();it!=m.end();it++){
		//string t=it->fi;
		int a=it->se;
		if(a>MAX){
			MAX=a;
			//str=t;
		}
	}
	if((n%2 && MAX<=n/2+1)||(n%2==0 && MAX<=n/2)) o("YES");
	else o("NO");
}