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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class A {
    public static void main(String args[]) throws IOException {
        BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
        String s = r.readLine();
        String[] inp = s.split(" ");
        int n = Integer.parseInt(inp[0]);
        s = r.readLine();
        inp = s.split(" ");
        int[] arr = readArr(inp);
        solve(n, arr);
    }

    private static int[] readArr(String[] inp) {
        int[] a = new int[inp.length];
        for (int i = 0; i < inp.length; i++) {
            a[i] = Integer.parseInt(inp[i]);
        }
        return a;
    }

    private static void solve(int n, int[] arr) {
        int[] c = new int[1000];
        int max = 0;
        for (int i = 0; i < arr.length; i++) {
            c[arr[i] - 1]++;
            max = Math.max(max, c[arr[i] - 1]);
        }

        if (max > (int) Math.ceil(n / (double) 2))
            System.out.println("NO");
        else
            System.out.println("YES");
    }

}
