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.
from sys import stdin
import math
from collections import defaultdict as dd
n=int(stdin.readline().rstrip())
l=list(int,stdin.readline().split())
d=dd(int)
for i in l:
    d[i]+=1
a=0
for i in d.keys():
    if d[i]>math.ceil(n/2):
        a=1
print("YES" if a==0 else "NO")