#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define MOD (ll)(1e9+7)
#define ADD(a,b) a=((a)+(b))%MOD
#define FIX(a) ((a)%MOD+MOD)%MOD

int main(){
  int n;
  cin>>n;
  map<string,int> mp;
  REP(i,n){
    string s;
    cin>>s;
    mp[s]++;
  }
  map<string,int>::iterator iter = mp.begin();
  while(iter!=mp.end()){
    int val = iter->second;
    if(val > (n+1)/2){
      cout<<"NO"<<endl;
      return 0;
    }
    ++iter;
  }
  cout<<"YES"<<endl;
  return 0;
}