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.
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;
public class a1
{
    public static void main(String[] args)
    {
        Scanner s=new Scanner(System.in);
        int n=s.nextInt();
        HashMap<Integer,Integer> h=new HashMap();
        ArrayList a=new ArrayList();
        for(int i=0;i<n;i++)
        {
            int m=s.nextInt();
            
            if(a.contains(m))
                h.put(m, h.get(m)+1);
            else
                h.put(m, 1);
            a.add(m);
        }
        Object[] arr=new Object[h.size()];;
        arr=h.values().toArray();
        Arrays.sort(arr);
        int sum=0;
        int w=(int) arr[arr.length-1];
        for(int o=0;o<arr.length-1;o++)
            sum+=(int)arr[o];
        if(sum>=w-1)
            System.out.println("YES");
        else
            System.out.println("NO");
    }
}

