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 sys
import math

n = int(sys.stdin.readline())
an = [int(x) for x in (sys.stdin.readline()).split()]

d = dict()

for i in an:
    if i in d:
        d[i] += 1
    else:
        d[i] = 1
        
vmax = 0
#vsum = 0
for i in list(d.keys()):
    #vsum += d[i]
    if(d[i] > vmax):
        vmax = d[i]
        
if(vmax <= (n + 1) / 2):
    print("YES")
else:
    print("NO")
    
    