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.

a= int(input())


t = list(map(int,input().split()))


f=[]


g = set(t)


for k in g:
    f.append(t.count(k))

f.sort()


h=0
for j in range(0,len(f),2):
    if f[j+1]-f[j]<=1:
        pass
    else:
        print('NO')
        h+=1
        break


if h==0:
    print('YES')
