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 -*-
"""
Created on Fri May 24 18:25:16 2019

@author: SANDEEP GHANTA
"""
inp=int(input())
lis=list(map(int,input().split()))
#print(inp)
#print(lis)
unique=set(lis)
#print(unique)
point=0
if inp==1:
  print("YES")
  exit()
for i in unique:
  if lis.count(i)>(round(len(lis)/2)):
    print("NO")
    point=1
    break
if point==0:
  print("YES")    
     
    