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 as ma
n=int(input())
arr=[int(i) for i in input().split()]
dic={}
if len(arr)==1:
    print('YES')
else:
    for i in range(n):
        if arr[i] not in dic:
            dic[arr[i]]=1
        else:
            dic[arr[i]]+=1

    m=0
    for i in dic:
        if dic[i]>m:
            m=dic[i]
    if m>ma.ceil(n//2+1):
        print("NO")
    else:
        print("YES")
