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.
def inp():
    ls=list(map(int,input().split()))
    return ls
t=int(input())
ls=inp()
ans=[0]*len(set(ls))
all=list(set(ls))
for i in range(len(set(ls))):
    for j in range(t):
        if all[i]==ls[j]:
            ans[i]+=1
#print(ans)
for i in ans:
    if i>(t+1)//2:
        print("NO")
        exit(0)
print("YES")