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.
import collections
de = collections.deque([])
n = int(input())
de = [int(x) for x in input().split()]
a = [val for val in set(de)]
b = []
total = 0
for i in a:
    b.append(de.count(i))
    total += de.count(i)

if total - max(b) >= max(b)-1:
    print("YES") 
else:
    print("NO")       