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.
from collections import defaultdict
n = int(input())
li = list(map(int, input().split()))

if n == 1:
	print('YES')
	exit()

d = defaultdict(int)

for i in li:
	d[i] += 1

t = [li[0]]
d[li[0]] -= 1

for i in range(1, n):
	if li[i] == t[-1]:
		for j in range(n):
			if li[j] != t[-1]:
				if d[li[j]]:
					d[li[j]] -= 1
					t.append(li[j])
					break
	else:
		t.append(li[i])
		d[li[i]] -= 1

if len(t) == n:
	print('YES')
else:
	print('NO')