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 math
n=int(input())
a=list(map(int,input().split()))
a1=list(set(a))
c=1
if(n>1):
    for i in a1:
        b=a.count(i)
        if(b>math.ceil(n/2)):
            print("NO")
            c=0
            break
    if(c==1):
        print("YES")
else:
    print("YES")