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.
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

import java.util.*;

/**
 *
 * @author F16
 */
public class JavaApplication1 {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        Scanner next=new Scanner(System.in);
        int x,y;
        x=next.nextInt();
        
        int g=(x+1)/2;
        
        HashMap  <Integer,Integer> m =new HashMap  <Integer,Integer>() ;
        for(int i=0;i<x;i++)
        {
            y=next.nextInt();
            if(m.containsKey(y))
            {
                int h=m.get(y);
                m.put(y, h+1);
            }
            else
            {
                m.put(y, 1);
            }
            
        }
        int j=0;
        for(Map.Entry<Integer, Integer> studentEntry : m.entrySet()){
            
            
                if(studentEntry.getValue()<=g)
                {
                    continue;
                }
                else
                {
                    j=1;
                    break;
                }
            }
        if(j==0)
            System.out.println("YES");
        else
            System.out.println("NO");
            
                // TODO code application logic here
    }
}
