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;

public class Problem1 implements Runnable {
    public void run() {
        Scanner scanner = new Scanner(System.in);
        PrintWriter writer = new PrintWriter(System.out);

        int n = scanner.nextInt();
        final int A_MAX = 1001;
        int [] a = new int[A_MAX];

        for (int i = 0; i < n; i++) {
            a[scanner.nextInt()]++;
        }
        int m = 0;
        if (n % 2 == 0) {
            m = n / 2;
        } else {
            m = n / 2 + 1;
        }
        String answer = "YES";
        for (int i = 0; i < A_MAX; i++) {
            if (a[i] > m) {
                answer = "NO";
            }
        }
        writer.println(answer);
        writer.close();
    }

    public static void main(String[] args) {
        new Problem1().run();
    }
}
