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 itertools, math

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

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

x = (i for i in itertools.permutations(x))

def is_distinct_list(l: tuple) -> bool:
	i = 0
	while i < n-1:
		if l[i] == l[i+1]:
			return False
		i += 1
	return True

for i in range(math.factorial(n)):
	if is_distinct_list(next(x)):
		print("YES")
		exit()

print("NO")