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.*;
import java.lang.*;


public class Main {

    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int in = input.nextInt();
        int[]  elements = new int[in];

        for (int i = 0; i < in; i++) {
            elements[i] = input.nextInt();
        }

        if (elements.length == 1) {
            System.out.println("YES");
        }else{
            Arrays.sort(elements);
            int n = elements.length;

            int countofmax = 1;
            int temp = elements[0];
            int count = 1;

            for (int i = 1; i < elements.length; i++)
            {
                if (elements[i] == elements[i - 1])
                    count++;
                else
                {
                    if (count > countofmax)
                    {
                        countofmax = count;
                        temp = elements[i - 1];
                    }
                    count = 1;
                }
            }


            if (count > countofmax)
            {
                countofmax = count;
                temp = elements[n - 1];
            }
            int countTimes = 0;

            for (int i = 0; i < elements.length; i++) {
                if (elements[i] == temp){
                    countTimes++;
                }
            }
            if (n % 2 == 0){
                if (countTimes <= n/2) {
                    System.out.println("YES");
                }else{
                    System.out.println("NO");
                }
            }else{
                if (countTimes <= (n/2) + 1){
                    System.out.println("YES");
                }else {
                    System.out.println("NO");
                }
            }
            
        }

    }
}

