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.

Input

The first line contains integer n (1 ≤ n ≤ 100) — the number of elements in the array. The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 1000) — the array elements.

Output

In the single line print "YES" (without the quotes) if Yaroslav can obtain the array he needs, and "NO" (without the quotes) otherwise.

Examples

Input

1
1


Output

YES


Input

3
1 1 2


Output

YES


Input

4
7 7 7 7


Output

NO

Note

In the first sample the initial array fits well.

In the second sample Yaroslav can get array: 1, 2, 1. He can swap the last and the second last elements to obtain it.

In the third sample Yarosav can't get the array he needs.
# -*- coding: utf-8 -*-
"""Untitled75.ipynb

Automatically generated by Colaboratory.

Original file is located at
    https://colab.research.google.com/drive/1D1x8mgVYBiLay890KzZPAq2TMoXX-k_G
"""

n=int(input())
l1=list(map(int,input().split()))
d={}
for x in l1:
  if x in d:
    d[x]=d[x]+1
  else:
    d[x]=1
max=0
for x in d:
  if d[x]>max:
    max=d[x]
m=max
if n%2==0:
  c=n//2
else:
  c=n//2+1
if m<=c:
  print("YES")
else:
  print("NO")