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 collections
if __name__ == "__main__":
	n = int(input())
	number = [int(x) for x in input().split(' ')]
	number = collections.Counter(number)
	if n % 2 == 0:
		if all(x <= n // 2 for x in number.values()):
			print("YES")
		else:
			print("NO")
	else:
		if all(x <= n // 2 + 1 for x in number.values()):
			print("YES")
		else:
			print("NO")