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()))
track = {}
for i in arr:
    if not (i in track.keys()):
        track[i] = 0
    track[i] += 1
counts = []
for i in track.keys():
    counts.append(track[i])
counts.sort()
counts.reverse()
for i in range(len(counts) - 1):
    curr = counts[i]
    sep = sum(counts[i + 1: len(counts)])
    if(sep < curr - 1):
        print("NO")
        break
else:
    if(len(counts) == 1):
        print("NO")
    else:
        print("YES")