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.
a=int(input())
b=list(map(int,input().split()))
c=b
if a==1:print("YES")
for i in range(a-1):
    if b[i]!=b[i+1]:
        c[i],c[i+1]=c[i+1],c[i]
    else:continue
for i in range(len(c)-1):
    if c[i]!=c[i+1]:print("YES")
    else:print("NO")
    break


