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.PrintWriter;
import java.util.Scanner;

/**
 * @author pvasilyev
 * @since 03 Nov 2016
 */
public class A269 {

    public static void main(String[] args) {
        final Scanner reader = new Scanner(System.in);
        final PrintWriter writer = new PrintWriter(System.out);

        solve(reader, writer);

        writer.close();
        reader.close();
    }

    private static void solve(final Scanner reader, final PrintWriter writer) {
        final int n = reader.nextInt();
        int[] hist = new int[1001];
        for (int i = 0; i < n; ++i) {
            final int nextInt = reader.nextInt();
            hist[nextInt]++;
        }
        int max = 0;
        for (int i = 0; i < hist.length; ++i) {
            max = Math.max(max, hist[i]);
        }

        if (max + max - 1 > n) {
            writer.println("NO");
        } else {
            writer.println("YES");
        }
    }

}
