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())
l = list(map(int,input().split()))
if len(set(l))==len(l):
    print('YES')
else:
    t1 ={}
    for i in range(n):
        if l[i] in t1:
            t1[l[i]]+=1
        else:
            t1[l[i]]=1
    tch = list(t1.values())
    if max(tch)<((n/2)+1):
        if len(set(tch))==len(tch):
            print('YES')
        else:
            print('NO')
    else:
        print('NO')