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,inpuit().split(" ")))
    if(n==1):
        print("YES")
    if(n==2):
        if(li[0]==li[1]):
            print("NO") 
        else:
            print("YES")
    else:        
        z=0
        para="true"
        for i in range(0,n-1):
            if(li[i]==li[i+1]):
                z+=1
                if(z==2):
                    para="false"
                    break
            else:
                z=0
                temp=li[i+1]
                li[i+1]=li[i]
                li[i]=temp
        if(para=="true"):
            print("YES")
        else:
            print("NO")
        