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.
x=[0]
m=x*1001
z=int(input())
for z in map(int,input().split()):
    m[z]+=1
s=max(m)
m[m.index(s)]=0
h=0
e=0
while(h<len(m)):
    e+=m[h]
    h+=1
if(e>=s-1):
    print("YES")
else:
    print("NO")        
