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.Scanner;

public class Main {

    private static int contar(int num, int[]cad) {
        int ctm = 0;
        for (int j = 0; j < cad.length; j++) {
            if (cad[j] == num) {
                ctm++;
            }
        }
        return ctm;
    }

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

        int tam = in.nextInt();
        int[] dat = new int[tam];

        for (int i = 0; i < tam; i++) {
            dat[i] = in.nextInt();
        }
        int maxi = 0;
        for (int i = 0; i < dat.length; i++) {
            maxi = Math.max(contar(dat[i], dat),maxi);
        }

        String rs = "NO";
        if (tam == 1) {
            rs = "YES";
        } else {
            int re = tam - maxi;
            if (maxi - re <= 1) {
                rs = "YES";
            }
        }
        System.out.println(rs);
    }
}