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())
b=list(map(int,input().split()))
k=[]
for i in b:
    if b.count(i)>=2:
     for l in range(b.count(i)):
        k.append(i)
     for j in range(b.count(i)):
            b.remove(i)
    else:continue
if len(k)<=len(b)+1:
    print("YES")
else:print("NO")