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 = input()
l = list(map(int,input().split()))
def check(l):
    for i in range(1,len(l)):
        if(l[i-1] != l[i]):
            return 1
        else:
            return 0
for i in range(1,len(l)-1):
    if(l[i-1] == l[i]):
        l[i],l[i+1] = l[i+1],l[i]            
if(check(l) == 1):
    print("YES")
else:
    print('NO')