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())
arr = [int(x) for x in input().split()]
max_freq = 0
freq= {}
for ele in arr:
	if ele not in freq:
		freq[ele] = 0
	freq[ele]+=1
	max_freq = max(max_freq,freq[ele])

if max_freq > int((n+1)/2):
	print("NO")
else:
	#Is there any way to get no?
	#n = 10
	#f = 4
	#f2 = 4
	#f3 = 2
	#abcabcabab
	
	print("YES")
