#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>

#define N 1000
#define MOD 1000000007
#define pe(str) return cout<<(str)<<endl,0
#define px(str) {cout<<(str)<<endl;exit(0);}
#define re(i,n) for(int i=0;i<(n);i++)
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define fe(i,n,f) for_each(i,n,f)
#define bw(a,b,c) (((a)<=(b))&&((b)<=(c)))
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> pii;

int main(void){
	string s;
	std::map<string,int> m;
	int n;
	cin>>n;
	re(i,n){
		cin>>s;
		m[s]++;
	}
	std::vector<int> v;
	for(__typeof(m.begin()) it=m.begin();it!=m.end();it++){
		v.push_back(it->second);
	}
	sort(v.begin(),v.end(),greater<int>() );
	while(v.size()>1){
		v[0]--;
		v[1]--;
		if(v[1]==0)v.erase(v.begin()+1);
		if(v[0]==0)v.erase(v.begin());
		// re(i,v.size())cout<<v[i]<<" ";
		// cout<<endl;
	}
	pe(v.size()==0||v.size()==1&&v[0]>1?"NO":"YES");
	return 0;
}