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())
dups=0
nums=list(map(int,input().split()))
count=0
printed=False
for i in range(1,n):
    if nums[i]==nums[i-1]:
        count+=1
    else:
        if count>=2:
            print('NO')
            printed=True
            break
        else:
            dups+=1
            count=0
if not printed and count>=2:
    print('NO')
else:
    if not printed:
        if dups>2:
            print('NO')
        else:
            print('YES')