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.
'''
INPUT SHORTCUTS
N, K = map(int,input().split())
N ,A,B = map(int,input().split())
string = str(input())
arr = list(map(int,input().split()))
N = int(input())
'''


def main():
	N = int(input())
	arr = list(map(int,input().split()))
	cnt = 1 
	max_cnt = 0
	i = 0
	while i+1<N:
		if arr[i]==arr[i+1]:
			cnt+=1
		else:
			cnt = 1
		i+=1
		max_cnt= max(max_cnt,cnt)
		
	if (max_cnt+(max_cnt-1) )<= N:
		print("YES")
		# print(max_cnt)
	else:
		print("NO")

main()