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.
n = int(input())
li = list(map(int, input().split()))
if n == 1:
	print('YES')
	exit()
for i in range(1, n):
	if li[i-1] == li[i]:
		try:
			li[i], li[i+1] = li[i+1], li[i]
		except:
			continue
for i in range(1, n):
	if li[i-1] == li[i]:
		print('NO')
		exit()
print('YES')
