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())
arr=[int(x) for x in input().split()]
arr=sorted(arr) 
arr1=[]
i=0
j=1
c=1 
for c in range(n):
    if c%2==0:
        arr1.append(arr[i])
        i+=1 
    else:
        arr1.append(arr[-j])
        j+=1 
    
cnt=0    
for i in range(n-1):
    if arr1[i]!=arr1[i+1]:
        cnt+=1 
if cnt+1==n:
    print("Yes")
else:
    print("NO")