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.
import sys
input = sys.stdin.readline

n = int(input())
lst = list(map(int, input().split()))

dupl = 1
maxx = 1
for i in range(1, n):
	if lst[i] == lst[i-1]:
		dupl += 1
		maxx = max(maxx, dupl)
	else:
		dupl = 1

if n == 1: print("YES")
elif dupl > n//2: print("NO")
else: print("YES")

