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.


if __name__=="__main__":
    
    n=int(input())
    li=list(map(int,input().split(" ")))
    ma=max(li)
    lis=[0 for x in range(ma+1)]
    z=-1
    for i in range(0,n):
        lis[li[i]]+=1
        if(lis[li[i]])>((n+1)/2):
            z=0
            break
    if(z==-1):
        print("YES")
    else:
        print("NO")
            