#include <iostream>
#include <string>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argc, char* argv[])
{
	int N;
	cin>>N;
	map<string,int> myMap;
	map<string,int>::iterator mit;
	int i;
	string A;
	for (i=0;i<N;i++){
		cin>>A;
		mit=myMap.find(A);
		if (mit==myMap.end()){
			myMap[A]=1;
		}else{
			(*mit).second++;
		}
	}
	if (myMap.size()<2){
		cout<<"NO"<<endl;
		return 0;
	}
	vector<int> myVec;
	vector<int>::iterator vit;
	for (mit=myMap.begin();mit!=myMap.end();mit++){
		myVec.push_back((*mit).second);
	}
	while (myVec.size()>1){
		sort(myVec.begin(),myVec.end());
		while (myVec.size()>0){
			if (myVec[0]==0){
				myVec.erase(myVec.begin());
			}else{
				break;
			}
		}
		int siz=myVec.size();
		if (siz>1){
			myVec[0]--;
			myVec[siz-1]--;
		}
	}
	if (myVec.size() == 0 || myVec[0]<=1){
		cout<<"YES"<<endl;
	}else{
		cout<<"NO"<<endl;
	}	

	return 0;
}