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.
n = int(input())
numbers = list(map(int, input().split()))
two_count = 0
if n == 1:
    print("YES")

else:
    x = numbers[0]
    temp = 1
    for i in numbers[1:n]:

        if i == x:
            temp += 1

        else:
            if temp == 2:
                two_count += 1
                if two_count > 2:
                    print("NO")
                    break
            elif temp > 2:
                print("NO")
                break

            x = i
            temp = 1
    else:
        print("YES")



