#include <vector> 
#include <list> 
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <queue>
using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }

//math
//-------------------------------------------
template<class T> inline T sqr(T x) { return x * x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
#define dump(x)  cerr << #x << '=' << (x) << endl;
#define debug(x) cerr << #x << '=' << (x) << '('<<'L' << __LINE__ << ')' << ' ' << __FILE__ << endl;

int main() {

	vector<pair<string, int> > items;

	
	int N;
	cin >> N;

	REP(i, N) {
		string a;
		cin >> a;
		int j = 0;
		for (; j < items.size();j++) {
			if (items[j].first == a) {

				goto NEXT;
			}
		}

		j = -1;
	NEXT:;
		if (j!=-1) {
			items[j].second++;
		}
		else {
			pair<string, int> item(a, 1);
			items.push_back(item);
		}
	}

	sort(items.begin(), items.end(), [&](pair<string, int> a, pair<string, int> b) {return a.second > b.second; });
	


	for(auto i : items) {
		cerr << i.first << " " << i.second << endl;
	}


	int sukimanamu=items[0].second-1;
	FOR(i, 1, items.size()) {
		sukimanamu -= items[i].second;
	}
	if (sukimanamu > 0) {
		cout << "NO" << endl;
	}
	else {
		cout << "YES" << endl;
	}
	cerr << endl;


}