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.
x = input()
arr = list(map(int, input() .split(" ")))
if len(arr)==1:
    print("YES")
elif len(arr)==2:
    if arr[0]!=arr[1]:
        print("YES")
    else:
        print("NO")
else:
    dec = False
    i = 1 
    while i<len(arr)-2:
        if arr[i]==arr[i-1]==arr[i+1]:
            dec = True
            break
    if dec:
        print("NO")
    else:
        print("YES")