Yaroslav has an array that consists of *n* integers. In one second Yaroslav can swap two neighboring array elements. Now Yaroslav is wondering if he can obtain an array where any two neighboring elements would be distinct in a finite time.

Help Yaroslav.
The first line contains integer *n* (1 ≤ *n* ≤ 100) — the number of elements in the array. The second line contains *n* integers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 1000) — the array elements.
# -*- coding: utf-8 -*-
"""
Created on Fri May 24 18:25:16 2019

@author: SANDEEP GHANTA
"""
inp=int(input())
lis=list(map(int,input().split()))
#print(inp)
#print(lis)
unique=set(lis)
#print(unique)
point=0
for i in unique:
  if lis.count(i)>(len(lis)/2):
    print("NO")
    point=1
    break
if point==0:
  print("YES")    
    