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.
n = int(input())
y = [int(i) for i in input().split()]
a = len(set(y))

arr1=[0]*101;

for i in y:
    arr1[i]+=1;

s=0

for i in arr1:
    if(i>=(n)//2): s+=1;

if(a>=(n)//2 and s>=(n)//2): print("YES")
else: print("NO")
