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.
#!/usr/bin/env python3
import sys

if __name__ == "__main__":
	n = int(sys.stdin.readline())
	ais = list(map(int, sys.stdin.readline().split()))
	flag = 1
	no = {}
	for ai in ais:
		if ai not in no:
			no[ai] = 0
		no[ai] += 1
	for o in no:
		if no[o] > n//2 + 1:
			flag = 0
	if flag == 1:
		print("YES")
	else:
		print("NO")
