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())
a=list(map(int,input().split()))
z=0
for i in range(n):
	c=0
	for j in range(1,n):
		if a[j-1]!=a[j]:
			a[j-1],a[j]=a[j],a[j-1]
			for k in range(1,n):
				if a[j-1]!=a[j]:
					c+=1
			if c==n-1:
				print("YES")
				z=1
				break
	if z==1:
		break
if i==n-1 and n>1:
	print("NO")
if n==1:
	print("YES")