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