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 =list(map(int,input().split()))
c = 0
if(n%2==0):
    c = int(n/2)
else:
    c = int(n/2)+1
d = {}
for i in arr:
    if i in d:
        d[i]+=1
    else:
        d[i] = 1
maxi = d[arr[0]]
for i in d:
    if d[i]>maxi:
        maxi = d[i]
if(maxi>c):
    print("NO")
else:
    print("YES")
