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.
z=int(input())
x=list(map(int,input().split()))
lst=[]
for i in set(x):
      lst.append(x.count(i))
lst.sort(reverse=1)
l=len(lst)
for i in range(l):
    if lst[i] == 0:
        continue
    for j in range(i+1,l):
        if lst[i] < lst[j] :
            lst[j]-=lst[i]         
            lst[i] =0
        else:
            lst[i]-=lst[j]
            lst[j]=0   
print(['NO','YES'][sum(lst)<2])
