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.
n=int(input())
a=list(map(int,input().split(" ")))
b=[]
c=[]
b.extend(a)
a=set(a)
a=list(a)
if n==1:
    print("YES")
else:
    for i in range(len(a)):
        c1 = 0
        for j in range(len(b)):
            if a[i] == b[j]:
                c1 += 1
        c.append(c1)
    c.sort()
    c.reverse()
    if len(c)==1:
        print("NO")
    else:
        e=c[0]
        c.pop(0)
        g=e-1
        if sum(c)>=g:
            print("YES")
        else:
            print("NO")