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.
#code
n=int(input())
a=list(map(int,input().split()))
b=set(a)

for i in b:
    cb=0
    for j in a:
        if j==i:
            cb+=1;
    if (n%2==1 and cb>(n/2)+1) or (n%2==0 and cb>n/2):
        print("NO")
        exit(0)
print("YES")