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 = input().split()
res = "YES"
for i in range(1,n) :
    if arr[i] != arr[i-1] :
        continue
    res = "NO"
    for j in range(i+1,n):
        if arr[i] != arr[j]:
            arr[i],arr[j] = arr[j],arr[i]
            # print(i,j,arr[i],arr[j])
            res = "YES"
            break
print(res)       
    