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()]

valid=True

for i in range(n):
    c=0
    for j in range(i,n):
        if arr[i]==arr[j]:
            c+=1
    
    if n < (2*c-1): # main condition by observation
         valid=False
         break


if valid:
    print ("YES")
else:
    print("NO")