#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
using namespace std;

int main(void){
  int n;
  cin >> n;
  map<string, int> map;
  for(int i = 0; i < n; i++){
    string s;
    cin >> s;
    map[s]++;
  }
  int m = 0;
  for(auto i = map.begin(); i != map.end(); i++)
    m = max(m, i->second);
  bool flag = false;
  if(m <= ceil((double)n / 2)) flag = true;
  if(flag) cout << "YES" << endl;
  else cout << "NO" << endl;
  return 0;
}